QCSP on Partially Reflexive Forests

DOI10.1007/978-3-642-23786-7_42zbMath1401.68124OpenAlexW1855557781MaRDI QIDQ3169451

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)

Related Items (4)

On the Complexity of the Model Checking Problem ⋮ Quantified Constraints in Twenty Seventeen ⋮ Constraint Satisfaction with Counting Quantifiers ⋮ The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation

This page was built for publication: QCSP on Partially Reflexive Forests