Author of the publication

Quantified Constraint Satisfaction on Monoids.

, and . CSL, volume 62 of LIPIcs, page 15:1-15:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

The Tractability Frontier of Graph-Like First-Order Query Sets.. J. ACM, 64 (4): 26:1-26:29 (2017)A rendezvous of logic, complexity, and algebra.. SIGACT News, 37 (4): 85-114 (2006)The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case. CoRR, (2006)A rendezvous of logic, complexity, and algebra.. ACM Comput. Surv., 42 (1): 2:1-2:32 (2009)Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness.. ICALP, volume 55 of LIPIcs, page 94:1-94:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms.. CP, volume 3258 of Lecture Notes in Computer Science, page 168-181. Springer, (2004)How Many Variables are Needed to Express an Existential Positive Query?, and . Theory Comput. Syst., 63 (7): 1573-1594 (2019)A Model for Generating Random Quantified Boolean Formulas., and . IJCAI, page 66-71. Professional Book Center, (2005)A Theory of Average-Case Compilability in Knowledge Representation.. IJCAI, page 455-460. Morgan Kaufmann, (2003)Block-Sorted Quantified Conjunctive Queries., and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 125-136. Springer, (2013)