The complete classification for quantified equality constraints

Zhuk, Dmitriy; Martin, Barnaby

doi:10.48550/arxiv.2104.00406

Cited by 1 publication

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we focus on CSPs with a interval domain U ⊂ R and we are interested in the class of CSPs that are ∃R-complete. We want to point out that there is also a large body of research that deals with infinite domains [52,50,10,12,28]. Most relevant for us is the work by Bodirsky, Jonsson and von Oertzen [11], who also studied CSPs over the reals and showed that a host of them are NP-hard to decide.…”

Section: Constraint Satisfaction Problemsmentioning

confidence: 99%

On Classifying Continuous Constraint Satisfaction Problems

Miltzow¹,

Schmiermann²

2021

Preprint

View full text Add to dashboard Cite

A continuous constraint satisfaction problem (CCSP) is a constraint satisfaction problem (CSP) with an interval domain U ⊂ R. We engage in a systematic study to classify CCSPs that are complete of the Existential Theory of the Reals, i.e., ∃R-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 ∃x1, . . . , xn ∈ R : Φ(x1, . . . , xn), where Φ is a well-formed quantifier-free formula consisting of the symbols {0, 1, x1, . . . , xn, +, •, ≥, >, ∧, ∨, ¬}, the goal is to check whether this sentence is true. Now the class ∃R is the family of all problems that admit a polynomial-time many-one reduction to ETR. It is known that NP ⊆ ∃R ⊆ 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 ∃R-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 ∃R-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 ∃R-completeness on the class of such CCSPs.Here, we call a function f : U 2 → R well-behaved if it is a C 2 -function, f (0, 0) = 0, all its partial derivatives fx, fy, f are rational in (0, 0), fx(0, 0) = 0 or fy(0, 0) = 0, and it can be computed on a real RAM. Furthermore we call f curved if the curvature of the curve given by f (x, y) = 0 is nonzero, at the origin. In this case we call f either convexly curved if the curvature is negative, or concavely curved if it is positive.We apply our findings to geometric packing and answer an open question by Abrahamsen et al. [5, FOCS 2020]. Namely, we establish ∃R-completeness of packing convex pieces into a square container under rotations and translations.

show abstract