Sunday, 24 October 2010

Constraint Satisfaction: A glimpse of computational complexity

A generic problem appear in many different fields from computer science applications to operations research is constraint satisfaction problem (CSP). M. Jerrum gives a generic outline on the field [doi]. An article by Bulatov-Marx on global cardinality constraint has recently appeared [doi].

No comments:

Post a Comment

(c) Copyright 2008-2015 Mehmet Suzen (suzen at acm dot org)

Creative Commons Licence
This work is licensed under a Creative Commons Attribution 3.0 Unported License.