Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Constraint Satisfaction Problems of Bounded Width - MaRDI portal

Constraint Satisfaction Problems of Bounded Width

From MaRDI portal
Publication:5171200

DOI10.1109/FOCS.2009.32zbMath1292.68088MaRDI QIDQ5171200

Libor Barto, Marcin Kozik

Publication date: 25 July 2014

Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)




Related Items (31)

On Planar Boolean CSPComplexity and polymorphisms for digraph constraint problems under some basic constructionsCSP for binary conservative relational structuresCircuit Satisfiability and Constraint Satisfaction Around Skolem ArithmeticConstraint Satisfaction Problems Solvable by Local Consistency MethodsEquivariant algorithms for constraint satisfaction problems over coset templatesCircuit satisfiability and constraint satisfaction around Skolem arithmeticPromise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean DichotomyList-homomorphism problems on graphs and arc consistencyOn the complexity of \(\mathbb{H}\)-coloring for special oriented treesUnnamed ItemThe smallest hard treesThe algebraic structure of the densification and the sparsification tasks for CSPsA new line of attack on the dichotomy conjectureMaltsev digraphs have a majority polymorphismGeneric expression hardness results for primitive positive formula comparisonUnnamed ItemAn algebraic hardness criterion for surjective constraint satisfaction.On the CSP Dichotomy ConjectureRigid binary relations on a 4-element domainThe complexity of the list homomorphism problem for graphsQuantified constraint satisfaction and the polynomially generated powers propertyCSP duality and trees of bounded pathwidthDecidability of absorption in relational structures of bounded width.Robustly Solvable Constraint Satisfaction ProblemsA Dichotomy for First-Order Reducts of Unary StructuresSolving CSPs Using Weak Local ConsistencyUnnamed ItemUnnamed ItemCharacterizations of several Maltsev conditions.Commutative idempotent groupoids and the constraint satisfaction problem.




This page was built for publication: Constraint Satisfaction Problems of Bounded Width