Applications of universal algebra and logic to the constraint satisfaction problem
March 31 to April 4, 2008
American Institute of Mathematics, Palo Alto, CA

Organizers:
Anuj Dawar, Phokion Kolaitis, Benoit Larose, and Matt Valeriote

Description:
This workshop, sponsored by AIM and the NSF, will be devoted to
advancing the understanding of the computational complexity of the
constraint satisfaction problem using methods and techniques from
universal algebra and logic. The intended participants are
researchers in computational complexity, universal algebra,
and logic. By bringing together researchers from these three areas,
progress could be made towards resolving long-standing open problems
about the complexity of constraint satisfaction. 

Deadline:
November 15, 2007  

Details:
http://aimath.org/ARCC/workshops/constraintsatis.html