Publication:5005107
From MaRDI portal
DOI10.4230/LIPIcs.MFCS.2018.11MaRDI QIDQ5005107
Barnaby Martin, Florent R. Madelaine
Publication date: 4 August 2021
computational complexity; constraint satisfaction; universal algebra; logic in computer science; quantified constraints
68Qxx: Theory of computing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance constraint satisfaction problems
- An optimal lower bound on the number of variables for graph identification
- Constraints, consistency and closure
- List homomorphisms and circular arc graphs
- Near-Unanimity Functions and Varieties of Reflexive Graphs
- The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
- A Sufficient Condition for Backtrack-Free Search
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Bi‐arc graphs and the complexity of list homomorphisms
- Constraint Satisfaction with Counting Quantifiers
- Classifying the Complexity of Constraints Using Finite Algebras