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