Periodic constraint satisfaction problems: Tractable subclasses
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1670830 (Why is no real title available?)
- scientific article; zbMATH DE number 437576 (Why is no real title available?)
- scientific article; zbMATH DE number 1335885 (Why is no real title available?)
- scientific article; zbMATH DE number 1487982 (Why is no real title available?)
- scientific article; zbMATH DE number 1775445 (Why is no real title available?)
- A new tractable class of constraint satisfaction problems
- Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
- Characterising tractable constraints
- Closure properties of constraints
- Complexity classifications of Boolean constraint satisfaction problems
- Constraints and universal algebra
- Constraints, consistency and closure
- On the algebraic structure of combinatorial problems
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The complexity of maximal constraint languages
- The complexity of satisfiability problems
Cited in
(3)
This page was built for publication: Periodic constraint satisfaction problems: Tractable subclasses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816674)