Publication:4495111
From MaRDI portal
zbMath0957.68081MaRDI QIDQ4495111
Publication date: 10 August 2000
68R05: Combinatorics in computer science
Related Items
Unnamed Item, Unnamed Item, Solving CSPs Using Weak Local Consistency, Quantified Constraints in Twenty Seventeen, Algebra and the Complexity of Digraph CSPs: a Survey, The Power of Linear Programming for General-Valued CSPs, Dualities for Constraint Satisfaction Problems, A Logical Approach to Constraint Satisfaction, CLAP: A New Algorithm for Promise CSPs, The smallest hard trees, Tractability in constraint satisfaction problems: a survey, List-homomorphism problems on graphs and arc consistency, Reflexive digraphs with near unanimity polymorphisms, Periodic constraint satisfaction problems: Tractable subclasses, \(H\)-coloring dichotomy revisited, A new line of attack on the dichotomy conjecture, There are no pure relational width 2 constraint satisfaction problems, Existentially restricted quantified constraint satisfaction, Relatively quantified constraint satisfaction, Peek arc consistency, The power of propagation: when GAC is enough, A new tractable class of constraint satisfaction problems, Constraint satisfaction with succinctly specified relations, Tractable combinations of theories via sampling, Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs, Semilattice polymorphisms and chordal graphs, Retractions onto series-parallel posets, On algebras with many symmetric operations, On the CSP Dichotomy Conjecture, CSP dichotomy for special triads
