Author of the publication

Periodic Constraint Satisfaction Problems: Tractable Subclasses.

. Constraints An Int. J., 10 (2): 97-113 (2005)

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

Arithmetic Constant-Depth Circuit Complexity Classes.. MFCS, volume 2747 of Lecture Notes in Computer Science, page 328-337. Springer, (2003)Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms.. CP, volume 3258 of Lecture Notes in Computer Science, page 168-181. Springer, (2004)Block-Sorted Quantified Conjunctive Queries., and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 125-136. Springer, (2013)An Algorithm for SAT Above the Threshold.. SAT, volume 2919 of Lecture Notes in Computer Science, page 14-24. Springer, (2003)The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case. CoRR, (2006)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)A rendezvous of logic, complexity, and algebra.. ACM Comput. Surv., 42 (1): 2:1-2:32 (2009)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)