Periodic constraint satisfaction problems: Tractable subclasses
From MaRDI portal
Publication:816674
DOI10.1007/s10601-005-0551-zzbMath1084.68120OpenAlexW2038688206MaRDI QIDQ816674
Publication date: 23 February 2006
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-005-0551-z
Cites Work
- Constraints, consistency and closure
- On the algebraic structure of combinatorial problems
- Constraints and universal algebra
- Characterising tractable constraints
- A new tractable class of constraint satisfaction problems
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Closure properties of constraints
- The complexity of maximal constraint languages
- The complexity of satisfiability problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
