Universiteit van Amsterdam

Events

Institute for Logic, Language and Computation

Please note that this newsitem has been archived, and may contain outdated information or links.

20-24 March 2006, Mathematics of constraint satisfaction: Algebra, Logic, and Graph Theory, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK

Date: 20-24 March 2006
Location: Isaac Newton Institute for Mathematical Sciences, Cambridge, UK

The study of constraint satisfaction problems (CSPs) began in the 1970's in artificial intelligence, where this paradigm is now as popular as ever, with hundreds of researchers using this framework to model and solve a wide variety of problems. In 1978, Thomas Schaefer published a seminal paper on the complexity classification of Boolean CSPs, and since then the importance of the CSP in theoretical computer science has continued to grow. For example, many standard complete problems for standard complexity classes are variants of CSPs, and some of the first optimal inapproximability results in combinatorial optimization were proved for certain CSPs.

For more information, see http://www.comlab.ox.ac.uk/mathscsp/.

Please note that this newsitem has been archived, and may contain outdated information or links.