Author of the publication

On the CSP Dichotomy Conjecture.

. CSR, volume 6651 of Lecture Notes in Computer Science, page 331-344. Springer, (2011)

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

Constraint Satisfaction Parameterized by Solution Size., and . SIAM J. Comput., 43 (2): 573-616 (2014)Constraint Satisfaction Problems and Global Cardinality Constraints, and . Communications of the ACM, 53 (9): 99--106 (2010)Quantified Constraints: Algorithms and Complexity., , , and . CSL, volume 2803 of Lecture Notes in Computer Science, page 58-70. Springer, (2003)The Complexity of the Counting Constraint Satisfaction Problem.. ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 646-661. Springer, (2008)On the Power of k -Consistency., , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 279-290. Springer, (2007)Dualities for Constraint Satisfaction Problems., , and . Complexity of Constraints, volume 5250 of Lecture Notes in Computer Science, page 93-124. Springer, (2008)Inferring Attitude in Online Social Networks Based on Quadratic Correlation., and . PAKDD (1), volume 8443 of Lecture Notes in Computer Science, page 139-150. Springer, (2014)The complexity of weighted and unweighted #CSP., , , , , and . J. Comput. Syst. Sci., 78 (2): 681-688 (2012)Complexity classification of counting graph homomorphisms modulo a prime number., and . CoRR, (2021)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)