The complexity of constraint satisfaction games and QCSP-Reference-Cited by-同舟云学术

The complexity of constraint satisfaction games and QCSP

Published:2009-09 Issue:9 Volume:207 Page:923-944
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Börner F.,Bulatov A.,Chen H.,Jeavons P.,Krokhin A.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference53 articles.

1. A linear time algorithm for testing the truth of certain quantified Boolean formulas;Aspvall;Information Processing Letters,1979

2. On the complexity of some coloring games;Bodlaender;International Journal of Foundations of Computer Science,1991

3. L. Bordeaux, E. Monfroy, Beyond NP: Arc-consistency for quantified constraints, in: Proceedings of CP’02, LNCS, vol. 2470, 2002, pp. 371–386.

4. F. Börner, A. Bulatov, P. Jeavons, A. Krokhin, Quantified constraints: algorithms and complexity, in: Proceedings of CSL’03, LNCS, vol. 2803, 2003, pp. 58–70.

5. F. Börner, A. Krokhin, A. Bulatov, P. Jeavons, Quantified Constraints and Surjective Polymorphisms, Technical Report PRG-RR-02-11, Computing Laboratory, University of Oxford, UK, 2002.

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Surjective polymorphisms of directed reflexive cycles;Algebra universalis;2023-11-17

2. The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation;ACM Transactions on Computational Logic;2023-01-18

3. QCSP Monsters and the Demise of the Chen Conjecture;Journal of the ACM;2022-10-28

4. QCSP on Reflexive Tournaments;ACM Transactions on Computational Logic;2022-04-06

5. The lattice and semigroup structure of multipermutations;International Journal of Algebra and Computation;2021-11-10