Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
The vertex separation and search number of a graph
Information and Computation
Complexity of tree homomorphisms
Discrete Applied Mathematics
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Graph of a Relational Structure and Constraint Satisfaction Problems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
Storage requirements for deterministic polynomialtime recognizable languages
Journal of Computer and System Sciences
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Congruence Distributivity Implies Bounded Width
SIAM Journal on Computing
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded pathwidth duality, putting the problem in nondeterministic logspace. This generalizes the analogous result of Dalmau and Krokhin for majority polymorphisms and lends further support to a conjecture suggested by Larose and Tesson.