QCSP on partially reflexive forests

DOI10.1007/978-3-642-23786-7_42MaRDI QIDQ3169451zbMATH OpenOpenAlexFDO

Authors Barnaby Martin

Publication date 23 September 2011

Published in Principles and Practice of Constraint Programming – CP 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23786-7_42

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• QCSP on partially reflexive cycles -- the wavy line of tractability
• QCSP on semicomplete digraphs
• Quantified constraint satisfaction problem on semicomplete digraphs
• Meditations on quantified constraint satisfaction
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(6)

• Constraint satisfaction with counting quantifiers
• QCSP on partially reflexive cycles -- the wavy line of tractability
• Quantified Constraints in Twenty Seventeen
• On the complexity of the model checking problem
• The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
• QCSP on semicomplete digraphs

This page was built for publication: QCSP on partially reflexive forests

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