QCSP monsters and the demise of the chen conjecture

DOI10.1145/3357713.3384232OpenAlexW3035200231MaRDI QIDQ5144900

Barnaby Martin, Dmitriy N. Zhuk

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.00239

zbMATH Keywords

computational complexityconstraint satisfactionuniversal algebraquantified constraints

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

The lattice and semigroup structure of multipermutations, Constraint satisfaction problem: what makes the problem easy, The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation