The truth of existential–universal sentences over the reals is decidable in one fixed level of the counting hierarchy, even when their integer polynomials are specified by arithmetic circuits; in particular, the existential theory of the reals lies in the counting hierarchy.
The truth of existential–universal sentences over the reals is decidable in one fixed level of the counting hierarchy, even when their integer polynomials are specified by arithmetic circuits; in particular, the existential theory of the reals lies in the counting hierarchy.
The truth of existential–universal sentences over the reals is decidable in one fixed level of the counting hierarchy, even when their integer polynomials are specified by arithmetic circuits; in particular, the existential theory of the reals lies in the counting hierarchy.
If correct, improves the known complexity upper bound for existential and existential–universal real sentences.
Can existential–universal real sentences be decided within the counting hierarchy?
Publication dates and editorial changes.
OpenAI reports real-sentence decision in the counting hierarchy
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
