QCSP Monsters and the Demise of the Chen Conjecture

DOI10.1145/3563820OpenAlexW2954569737WikidataQ122897627 ScholiaQ122897627MaRDI QIDQ5889780FDOQ5889780

Authors: D. N. Zhuk, Barnaby Martin 

Publication date: 27 April 2023

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3563820

Recommendations

• QCSP monsters and the demise of the chen conjecture
• Quantified constraint satisfaction and the polynomially generated powers property
• Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
• The complexity of quantified constraints using the algebraic formulation
• STACS 2005

zbMATH Keywords

computational complexityconstraint satisfaction problemrelational clonesquantified constraintsweak near-unanimityCSP dichotomy

Mathematics Subject Classification ID

Computer science (68-XX)

Cited In (2)

• Generalisations of matrix partitions: complexity and obstructions
• Unifying the three algebraic approaches to the CSP via minimal Taylor algebras

This page was built for publication: QCSP Monsters and the Demise of the Chen Conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889780)