A polynomial relational class of binary CSP
From MaRDI portal
Publication:722101
DOI10.1007/s10472-017-9566-6zbMath1484.68071OpenAlexW2766016802MaRDI QIDQ722101
Wady Naanaa, Wafa Jguirim, Martin C. Cooper
Publication date: 20 July 2018
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://oatao.univ-toulouse.fr/22115/1/Jguirim_22115.pdf
Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Computational aspects of satisfiability (68R07)
Cites Work
- Tractability in constraint satisfaction problems: a survey
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- Network-based heuristics for constraint-satisfaction problems
- An optimal k-consistency algorithm
- Constraints, consistency and closure
- On the algebraic structure of combinatorial problems
- Constraint satisfaction over connected row-convex constraints
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- A comparison of structural CSP decomposition methods
- Domain permutation reduction for constraint satisfaction problems
- An optimal coarse-grained arc consistency algorithm
- Near Unanimity Constraints Have Bounded Pathwidth Duality
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- A sufficient condition for backtrack-bounded search
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Arc consistency and friends
- Classifying the Complexity of Constraints Using Finite Algebras
- Tractable constraints on ordered domains
