Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.68436DBLPconf/cie/2006OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898832

Florent R. Madelaine, Barnaby Martin

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Quantified Constraint Satisfaction Problem on Semicomplete Digraphs ⋮ The complexity of constraint satisfaction games and QCSP ⋮ On the Complexity of the Model Checking Problem ⋮ First-Order Model Checking Problems Parameterized by the Model ⋮ Low-level dichotomy for quantified constraint satisfaction problems ⋮ 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: Logical Approaches to Computational Barriers