Theory of linear and integer programming
Theory of linear and integer programming
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
The Approximability of Three-valued MAX CSP
SIAM Journal on Computing
Boolean Functions
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
MAX ONES Generalized to Larger Domains
SIAM Journal on Computing
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
The complexity of soft constraint satisfaction
Artificial Intelligence
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Approximating np-hard problems efficient algorithms and their limits
Approximating np-hard problems efficient algorithms and their limits
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
On the Unique Games Conjecture (Invited Survey)
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
Hybrid tractability of valued constraint problems
Artificial Intelligence
An algebraic theory of complexity for valued constraints: establishing a Galois connection
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Min CSP on four elements: moving beyond submodularity
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Linear programming, width-1 CSPs, and robust satisfaction
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
An algebraic characterisation of complexity for valued constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Robust satisfiability of constraint satisfaction problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Constraint optimization problems and bounded tree-width revisited
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
The Power of Linear Programming for Valued CSPs
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
The power of linear programming for finite-valued CSPs: a constructive characterization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
The complexity of three-element min-sol and conservative min-cost-hom
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |
Let Γ be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The valued constraint satisfaction problem, VCSP(Γ), is the problem of minimising a function given as a sum of functions from Γ. We establish a dichotomy theorem with respect to exact solvability for all finite-valued languages defined on domains of arbitrary finite size. We show that every core language Γ either admits a binary idempotent and symmetric fractional polymorphism in which case the basic linear programming relaxation solves any instance of VCSP(Γ) exactly, or Γ satisfies a simple hardness condition that allows for a polynomial-time reduction from Max-Cut to VCSP(Γ). In other words, there is a single algorithm for all tractable cases and a single reason for intractability. Our results show that for exact solvability of VCSPs the basic linear programming relaxation suffices and semidefinite relaxations do not add any power. Our results generalise all previous partial classifications of finite-valued languages: the classification of {0,1}-valued languages containing all unary functions obtained by Deineko et al. [JACM'06]; the classifications of {0,1}-valued languages on two-element, three-element, and four-element domains obtained by Creignou [JCSS'95], Jonsson et al. [SICOMP'06], and Jonsson et al.[CP'11], respectively; the classifications of finite-valued languages on two-element and three-element domains obtained by Cohen et al. [AIJ'06] and Huber et al. [SODA'13], respectively; the classification of finite-valued languages containing all {0,1}-valued unary functions obtained by Kolmogorov and Zivny [JACM'13]; and the classification of Min-0-Ext problems obtained by Hirai [SODA'13].