Abstract
We study interactive proofs in the framework of real number complexity theory as introduced by Blum, Shub, and Smale. Shamir’s famous result characterizes the class IP as PSPACE or, equivalently, as PAT and PAR in the Turing model. Since space resources alone are known not to make much sense in real number computations the question arises whether IP can be similarly characterized by one of the latter classes. Ivanov and de Rougemont [9] started this line of research showing that an analogue of Shamir’s result holds in the additive Blum-Shub-Smale model of computation when only Boolean messages can be exchanged. Here, we introduce interactive proofs in the full BSS model. As main result we prove an upper bound for the class \(\mathrm{IP}_{{\mathbb R}}\). It gives rise to the conjecture that a characterization of \(\mathrm{IP}_{{\mathbb R}}\) will not be given via one of the real complexity classes \(\mathrm{PAR}_{{\mathbb R}}\) or \(\mathrm{PAT}_{{\mathbb R}}\). We report on ongoing approaches to prove as well interesting lower bounds for \(\mathrm{IP}_{{\mathbb R}}\).
K. Meer—Both authors were supported under projects ME 1424/7-1 and ME 1424/7-2 by the Deutsche Forschungsgemeinschaft DFG. We gratefully acknowledge the support.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
The simultaneous requirement of exponential time and polynomial space excludes the above mentioned coding trick from [11] and makes the definition meaningful.
- 2.
This of course only makes sense after \(\mathrm{MA}\exists _{{\mathbb R}}\) has been defined precisely.
- 3.
Though formally the classes in [9] are defined a bit differently it is easy to see that their protocols used to prove the theorem fit into \(\mathrm{IP}_{{\mathbb R}}\).
References
Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)
Baartse, M., Meer, K.: The PCP theorem for NP over the reals. Found. Comput. Math. Springer. doi:10.1007/s10208-014-9188-x
Basu, S., Zell, T.: Polynomial hierarchy, Betti numbers, and a real analogue of Toda’s theorem. Found. Comput. Math. 10(4), 429–454 (2010)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, New York (1998)
Bürgisser, P., Cucker, F.: Counting complexity classes for numeric computations I: semilinear sets. SIAM J. Comput. 33(1), 227–260 (2003)
Bürgisser, P., Cucker, F.: Counting complexity classes for numeric computations. II. algebraic and semialgebraic sets. J. Complex. 22(2), 147–191 (2006)
Cucker, F.: On the complexity of quantifier elimination: the structural approach. Comput. J. 36(5), 400–408 (1993)
Cucker, F., Briquel, I.: A note on parallel and alternating time. J. Complex. 23, 594–602 (2007)
Ivanov, S., de Rougemont, M.: Interactive protocols on the reals. Comput. Complex. 8, 330–345 (1999)
Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859–868 (1992)
Michaux, C.: Une remarque à propos des machines sur \(\mathbb{R}\) introduites par Blum. Shub et Smale. C.R. Acad. Sci. Paris, t. 309, Série I, pp. 435–437 (1989)
Shamir, A.: IP = PSPACE. J. ACM 39(4), 869–877 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Baartse, M., Meer, K. (2015). Some Results on Interactive Proofs for Real Computations. In: Beckmann, A., Mitrana, V., Soskova, M. (eds) Evolving Computability. CiE 2015. Lecture Notes in Computer Science(), vol 9136. Springer, Cham. https://doi.org/10.1007/978-3-319-20028-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-20028-6_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20027-9
Online ISBN: 978-3-319-20028-6
eBook Packages: Computer ScienceComputer Science (R0)