Tractability conditions for numeric CSPs

  title={Tractability conditions for numeric CSPs},
  author={Peter Jonsson and Johan Thapper},
  journal={Theor. Comput. Sci.},
Abstract The computational complexity of the constraint satisfaction problem (CSP) with semilinear relations over the reals has gained recent attraction. As a result, its complexity is known for all finite sets of semilinear relations containing the relation R + = { ( x , y , z ) ∈ R 3 | x + y = z } . We consider larger and more expressive classes of relations such as semialgebraic and o-minimal relations. We present a general result for characterising computationally hard fragments and, under… Expand
1 Citations
Spectraèdres tropicaux: application à la programmation semi-définie et aux jeux à paiement moyen. (Tropical spectrahedra: Application to semidefinite programming and mean payoff games)
La programmation semi-definie est un outil fondamental d'optimisation convexe et polynomiale. Elle revient a optimiser une fonction lineaire sur un spectraedre (un ensemble defini par des inegalitesExpand


Affine Consistency and the Complexity of Semilinear Constraints
An algorithm is introduced, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time, and it is shown that determining the complexity of these problems may be highly non-trivial. Expand
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
An algorithm is introduced, based on computing affine hulls, which solves a new class of semilinear CSPs in polynomial time, and analyses the complexity of linear optimisation over the solution set and the existence of integer solutions. Expand
Classifying the Complexity of Constraints Using Finite Algebras
It is shown that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra is explored. Expand
A Proof of CSP Dichotomy Conjecture
  • Dmitriy Zhuk
  • Computer Science, Mathematics
  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
An algorithm is presented that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture. Expand
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction
The results imply that several families of constraint satisfaction problems exhibit a complexity dichotomy: the problems are either polynomial-time solvable or NP-hard depending on the choice of the allowed relations. Expand
Constraint Satisfaction Problems over Numeric Domains
A survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers is presented, to identify those CSPs that can be solved in polynomial time, and to distinguish them from C SPs that are NP-hard. Expand
Non-dichotomies in Constraint Satisfaction Complexity
It is shown that every computational decision problem is polynomial-time equivalent to a constraint satisfaction problem (CSP) with an infinite template and that if the so-called local-global conjecture for infinite constraint languages(over a finite domain) is false, then there is no dichotomy for the constraints satisfaction problem for infinite constraints languages. Expand
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy. Expand
Computational complexity of linear constraints over the integers
The powerful Horn disjunctive linear relations (Horn DLR) formalism adapted for discrete time is considered and it is shown that the full formalism is NP-hard and several maximal tractable subclasses are identified. Expand
The complexity of temporal constraint satisfaction problems
This work presents a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint language is contained in one out of nine temporal constraint language, then the CSP can be solved in polynomial time; otherwise, the C SP is NP-complete. Expand