[Acm-announce] Next ACM meeting is Thursday (4/9) at 5:30pm in SEO 1000

[Gary Turovsky]

Hello,

The next ACM meeting will be held this Thursday at 5:30pm in SEO  
1000.  The talk will be about the Satisfiability Problem (called SAT,  
for short) and will be given by Dr. John Lillis.

The Satisfiability Problem can be stated as follows:  given a boolean  
formula, does there exist an assignment to the variables such that the  
formula evaluates to TRUE?

SAT is among the most fundamental and heavily studied problems in  
Computer Science and was the first problem shown to be NP-Complete.    
It has applications in AI, Automated Planning and verification of  
electronic systems.

It should be a pretty great talk.  And, as always, there will be free  
food and drink.

See you all there!
Gary Turovsky
ACM President