Binary vs. non-binary constraints
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- Decomposable constraints
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- On forward checking for non-binary constraint satisfaction.
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
- Partition search for non-binary constraint satisfaction
- Domain filtering consistencies for non-binary constraints
- Constraints in non-Boolean contexts
- scientific article; zbMATH DE number 2080336 (Why is no real title available?)
- scientific article; zbMATH DE number 2084704 (Why is no real title available?)
- scientific article; zbMATH DE number 2084714 (Why is no real title available?)
- On forward checking for non-binary constraint satisfaction
- Methods and Applications of Artificial Intelligence
- Binarisation for valued constraint satisfaction problems
- scientific article; zbMATH DE number 2243409 (Why is no real title available?)
- Arc consistency revisited
- On the power of structural decompositions of graph-based representations of constraint problems
This page was built for publication: Binary vs. non-binary constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614859)