Testing the Complexity of a Valued CSP Language
From MaRDI portal
Publication:5091236
DOI10.4230/LIPIcs.ICALP.2019.77OpenAlexW2965163924MaRDI QIDQ5091236
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1803.02289
Related Items (2)
Minimum Violation Vertex Maps and Their Applications to Cut Problems ⋮ External Observer Reflections on QBism, Its Possible Modifications, and Novel Applications
Cites Work
- Unnamed Item
- Strong partial clones and the time complexity of SAT problems
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- The core of a graph
- Geometric algorithms and combinatorial optimization
- A note on the complexity of the chromatic number problem
- Which problems have strongly exponential complexity?
- Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties.
- Complexity of conservative constraint satisfaction problems
- The Complexity of Finite-Valued CSPs
- Lower Bounds for the Graph Homomorphism Problem
- The Time Complexity of Constraint Satisfaction
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- Set Partitioning via Inclusion-Exclusion
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- The Complexity of Satisfiability of Small Depth Circuits
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Asking the Metaquestions in Constraint Tractability
- Time Complexity of Constraint Satisfaction via Universal Algebra
- 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
- Recent Advances in Constraints
- On the complexity of \(k\)-SAT
This page was built for publication: Testing the Complexity of a Valued CSP Language
