Abstract
We introduce and study the notion of probabilistically checkable proofs for real number algorithms. Our starting point is the computational model of Blum, Shub, and Smale and the real analogue \(\mbox{NP}_{\mathbb R}\) of \(\mbox{NP}\) in that model. Our main result is, to the best of our knowledge, the first PCP theorem for \(\mbox{NP}_{\mathbb R}\). It states \(\\mbox{NP}_{\mathbb R} \subseteq \mbox{PCP}_{\mathbb R}(poly,O(1)).\) The techniques used extend ideas from [7] for self-testing and -correcting certain functions over so-called rational domains to more general domains over the real numbers. Thus, independently from real number complexity theory, the paper can be seen as a contribution to constructing self testers and correctors for linear functions over real domains.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. In: Proc. 33rd FOCS, pp. 14–23 (1992)
Arora, S., Safra, S.: Probabilistic checking proofs: A new characterization of NP. Journal of the ACM 45, 70–122 (1998)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)
Gemmell, P., Lipton, R., Rubinfeld, R., Sudan, M., Widgerson, A.: Self- Testing/Correcting for Polynomials and for Approximate Functions. In: Proc. of the 23rd STOCS, pp. 32–42 (1991)
Ivanov, S., de Rougemont, M.: Interactive Protocols on the reals. Computational Complexity 8, 330–345 (1999)
Rubinfeld, R., Sudan, M.: Self-testing polynomial functions efficiently and over rational domains. In: Proc. 3rd SODA, pp. 23–32 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meer, K. (2004). Transparent Long Proofs: A First PCP Theorem for \(\mbox{NP}_{\mathbb R}\) . In: DÃaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_80
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive