DeepAI AI Chat
Log In Sign Up

Beyond the Existential Theory of the Reals

by   Marcus Schaefer, et al.

We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger completeness results for various computational problems. We exhibit several families of complete problems which can be used for future completeness results in the real hierarchy. As an application we sharpen some results by Bürgisser and Cucker on the complexity of properties of semialgebraic sets, including the Hausdorff distance problem also studied by Jungeblut, Kleist, and Miltzow.


page 1

page 2

page 3

page 4


Completeness in Polylogarithmic Time and Space

Complexity theory can be viewed as the study of the relationship between...

Dynamic Toolbox for ETRINV

Recently, various natural algorithmic problems have been shown to be ∃R-...

Imperfect Gaps in Gap-ETH and PCPs

We study the role of perfect completeness in probabilistically checkable...

Measuring the Completeness of Theories

We use machine learning to provide a tractable measure of the amount of ...

Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Clifford Hierarchy

The "Sum-Over-Paths" formalism is a way to symbolically manipulate linea...

Exact Completeness of LP Hierarchies for Linear Codes

Determining the maximum size A_2(n,d) of a binary code of blocklength n ...

∀∃R-completeness and area-universality

In the study of geometric problems, the complexity class ∃R turned out t...