Some Results on Interactive Proofs for Real Computations
From MaRDI portal
Publication:3195685
DOI10.1007/978-3-319-20028-6_11zbMath1461.03042OpenAlexW1167885226MaRDI QIDQ3195685
Publication date: 20 October 2015
Published in: Evolving Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-20028-6_11
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computation over the reals, computable analysis (03D78)
Related Items (1)
Cites Work
- Unnamed Item
- Interactive protocols over the reals
- Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem
- A note on parallel and alternating time
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- The PCP theorem for NP over the reals
- On the Complexity of Quantifier Elimination: the Structural Approach
- Algebraic methods for interactive proof systems
- IP = PSPACE
- Counting Complexity Classes for Numeric Computations I: Semilinear Sets
- Computational Complexity
This page was built for publication: Some Results on Interactive Proofs for Real Computations