Some structural complexity results for R
From MaRDI portal
Publication:6897643
Cites work
- A note on non-complete problems in \(NP_\mathbb{R}\)
- A uniform approach to obtain diagonal sets in complexity classes
- An explicit solution to Post's problem over the reals
- Complexity of some geometric and topological problems
- Descriptive complexity of real computation and probabilistic independence logic
- Finite model theory and its applications.
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 953024 (Why is no real title available?)
- scientific article; zbMATH DE number 3336816 (Why is no real title available?)
- On Ladner's result for a class of real machines with restricted use of constants
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- On the Structure of $\cal NP_\Bbb C$
- On the Structure of Polynomial Time Reducibility
- P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\)
- Real number models under various sets of operations
- RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Relativizations of the P=?NP question over the reals (and other ordered rings)
- Saturation and stability in the theory of computation over the reals
- The separation of relativized versions of P and DNP for the ring of the reals
This page was built for publication: Some structural complexity results for \(\exists{\mathbb{R}} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897643)
