Home → Magazine Archive → September 2010 (Vol. 53, No. 9) → Technical Perspective: Constraint Satisfaction Problems... → Abstract

Technical Perspective: Constraint Satisfaction Problems and Computational Complexity

By Mark Jerrum

Communications of the ACM, Vol. 53 No. 9, Page 98

It takes little imagination to come up with a wealth of problems in scheduling and planning that can be expressed as Constraint Satisfaction Problems (CSPs). It's no surprise, then, that CSPs have an important place in the fields of AI and operations research.

The full text of this article is premium content


No entries found