On Classifying Continuous Constraint Satisfaction problems

by   Tillmann Miltzow, et al.

A continuous constraint satisfaction problem (CCSP) is a constraint satisfaction problem (CSP) with a domain U ⊂ℝ. We engage in a systematic study to classify CCSPs that are complete of the Existential Theory of the Reals, i.e., ER-complete. To define this class, we first consider the problem ETR, which also stands for Existential Theory of the Reals. In an instance of this problem we are given some sentence of the form ∃ x_1, …, x_n ∈ℝ : Φ(x_1, …, x_n), where Φ is a well-formed quantifier-free formula consisting of the symbols {0, 1, +, ·, ≥, >, ∧, ∨, }, the goal is to check whether this sentence is true. Now the class ER is the family of all problems that admit a polynomial-time reduction to ETR. It is known that NP ⊆ ER ⊆ PSPACE. We restrict our attention on CCSPs with addition constraints (x + y = z) and some other mild technical condition. Previously, it was shown that multiplication constraints (x · y = z), squaring constraints (x^2 = y), or inversion constraints (x· y = 1) are sufficient to establish ER-completeness. We extend this in the strongest possible sense for equality constraints as follows. We show that CCSPs (with addition constraints and some other mild technical condition) that have any one well-behaved curved equality constraint (f(x,y) = 0) are ER-complete. We further extend our results to inequality constraints. We show that any well-behaved convexly curved and any well-behaved concavely curved inequality constraint (f(x,y) ≥ 0 and g(x,y) ≥ 0) imply ER-completeness on the class of such CCSPs. We apply our findings to geometric packing and answer an open question by Abrahamsen et al. [FOCS 2020]. Namely, we establish ER-completeness of packing convex pieces into a square container under rotations and translations.



There are no comments yet.


page 28

page 33


Asking the metaquestions in constraint tractability

The constraint satisfaction problem (CSP) involves deciding, given a set...

Best-case and Worst-case Sparsifiability of Boolean CSPs

We continue the investigation of polynomial-time sparsification for NP-c...

Decision Procedure for the Existence of Two-Channel Prefix-Free Codes

The Kraft inequality gives a necessary and sufficient condition for the ...

Tractable Set Constraints

Many fundamental problems in artificial intelligence, knowledge represen...

ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network

We study the 2-ary constraint satisfaction problems (2-CSPs), which can ...

Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction

We consider the quantified constraint satisfaction problem (QCSP) which ...

Path Puzzles: Discrete Tomography with a Path Constraint is Hard

We prove that path puzzles with complete row and column information--or ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.