Collapsibility in Infinite-Domain Quantified Constraint Satisfaction

DOI10.1007/11874683_13MaRDI QIDQ3613338zbMATH OpenOpenAlexFDO

Authors Manuel Bodirsky, Hubie Chen

Publication date 12 March 2009

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11874683_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Applications of universal algebra in computer science (08A70)

Recommendations

• The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
• Meditations on quantified constraint satisfaction
• Computer Science Logic
• Existentially restricted quantified constraint satisfaction
• Complexity of infinite-domain constraint satisfaction

Cited in

(5)

• A Saturation Method for Collapsible Pushdown Systems
• \(\Lambda \)-ultrametric spaces and lattices of equivalence relations
• The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
• The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
• An initial study of time complexity in infinite-domain constraint satisfaction

This page was built for publication: Collapsibility in Infinite-Domain Quantified Constraint Satisfaction

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