Some results on interactive proofs for real computations

DOI10.1007/978-3-319-20028-6_11MaRDI QIDQ3195685zbMATH OpenOpenAlexFDO

Authors Martijn Baartse, Klaus Meer

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

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Interactive proofs and a Shamir-like result for real number computations
• Real interactive proofs for VPSPACE
• Interactive protocols over the reals
• Topics in real and complex number complexity theory
• scientific article; zbMATH DE number 66620

Cites work

• A note on parallel and alternating time
• Algebraic methods for interactive proof systems
• Computational Complexity
• Counting Complexity Classes for Numeric Computations I: Semilinear Sets
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
• scientific article; zbMATH DE number 4114603 (Why is no real title available?)
• Interactive protocols over the reals
• IP = PSPACE
• On the Complexity of Quantifier Elimination: the Structural Approach
• The PCP theorem for NP over the reals

Cited in

(4)

• Interactive protocols over the reals
• Interactive proofs and a Shamir-like result for real number computations
• Real interactive proofs for VPSPACE
• On interactive oracle proofs for Boolean R1CS statements

This page was built for publication: Some results on interactive proofs for real computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195685)