scientific article; zbMATH DE number 7278070
From MaRDI portal
Publication:5136286
DOI10.4230/LIPIcs.ISAAC.2017.65zbMath1457.68130MaRDI QIDQ5136286
Publication date: 25 November 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
constraint satisfaction problemalgebraic approachpolymorphismsclosed under inverse homomorphismshybrid CSPslifted language
Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Relational systems, laws of composition (08A02) Computational aspects of satisfiability (68R07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- Hybrid tractability of valued constraint problems
- Existence theorems for weakly symmetric operations
- On the complexity of H-coloring
- On the algebraic structure of combinatorial problems
- Domain permutation reduction for constraint satisfaction problems
- Level of repair analysis and minimum cost homomorphisms of graphs
- Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
- Complexity of conservative constraint satisfaction problems
- A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
- Sherali-Adams Relaxations for Valued CSPs
- Effectiveness of Structural Restrictions for Hybrid CSPs
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Classifying the Complexity of Constraints Using Finite Algebras
- The complexity of conservative valued CSPs
- The complexity of satisfiability problems
- On the Reduction of the CSP Dichotomy Conjecture to Digraphs
- Datalog and Constraint Satisfaction with Infinite Templates
- The complexity of theorem-proving procedures
- On the hardness of approximating the chromatic number
This page was built for publication:
