acm-header
Sign In

Communications of the ACM

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

Technical Perspective: Constraint Satisfaction Problems and Computational Complexity

By Mark Jerrum
Communications of the ACM, September 2010, Vol. 53 No. 9, Page 98
10.1145/1810891.1810913
Comments
View as: Print Mobile App ACM Digital Library In the Digital Edition Share: Send by email Share on reddit Share on StumbleUpon Share on Hacker News Share on Tweeter Share on Facebook
Share

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

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
  

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account