scientific article; zbMATH DE number 7559161

DOI10.4230/LIPIcs.STACS.2019.52MaRDI QIDQ5090503

Gregor Matl, Stanislav Živný

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

constraint satisfaction problemsgraph cutssurjective constraint satisfactionvalued constraint satisfaction

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Minimum Violation Vertex Maps and Their Applications to Cut Problems

Cites Work

• The complexity of surjective homomorphism problems-a survey
• Colouring, constraint satisfaction, and complexity
• On the complexity of H-coloring
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The complexity of soft constraint satisfaction
• The complexity of global cardinality constraints
• Towards Minimizing k-Submodular Functions
• The Complexity of Finite-Valued CSPs
• Algebraic Properties of Valued Constraint Satisfaction Problem
• 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
• A Polynomial Algorithm for the k-cut Problem for Fixed k
• The Complexity of Multiterminal Cuts
• Closure properties of constraints
• On generating all solutions of generalized satisfiability problems
• The Complexity of Boolean Surjective General-Valued CSPs
• The Power of Linear Programming for General-Valued CSPs
• The Complexity of General-Valued CSPs
• Classifying the Complexity of Constraints Using Finite Algebras
• The complexity of satisfiability problems

This page was built for publication: