New schemes for simplifying binary constraint satisfaction problems
From MaRDI portal
Recommendations
Cited in
(11)- Fundamental properties of neighbourhood substitution in constraint satisfaction problems
- Binary constraint satisfaction problems defined by excluded topological minors
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- Variable and value elimination in binary constraint satisfaction via forbidden patterns
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Extremal CSPs
- scientific article; zbMATH DE number 1231545 (Why is no real title available?)
- Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
- Logic for Programming, Artificial Intelligence, and Reasoning
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This page was built for publication: New schemes for simplifying binary constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386610)