Author of the publication

09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability.

, , , and . The Constraint Satisfaction Problem: Complexity and Approximability, volume 09441 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra., , and . J. ACM, 50 (5): 591-640 (2003)Classifying the Complexity of Constraints Using Finite Algebras., , and . SIAM J. Comput., 34 (3): 720-742 (2005)Robust Satisfiability for CSPs: Hardness and Algorithmic Results., and . TOCT, 5 (4): 15:1-15:25 (2013)Congruences of Clone Lattices, II.. Order, 18 (2): 151-159 (2001)Retractions onto series-parallel posets., , and . Discret. Math., 308 (11): 2104-2114 (2008)Recognizing Frozen Variables in Constraint Satisfaction Problems, and . Electron. Colloquium Comput. Complex., (2003)Computational complexity of auditing finite attributes in statistical databases., and . J. Comput. Syst. Sci., 74 (5): 898-909 (2008)Polymorphisms, and How to Use Them., , and . The Constraint Satisfaction Problem, volume 7 of Dagstuhl Follow-Ups, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)The approximability of MAX CSP with fixed-value constraints, , , and . CoRR, (2006)Constraint Satisfaction Problems and Finite Algebras., , and . ICALP, volume 1853 of Lecture Notes in Computer Science, page 272-282. Springer, (2000)