Abstract
We study probabilistically checkable proofs (PCPs) in the real number model of computation as introduced by Blum, Shub, and Smale. Our main result is NPℝ = PCPℝ(O(logn), polylog(n)), i.e., each decision problem in NPℝ is accepted by a verifier that generates O(logn) many random bits and reads polylog(n) many proof components. This is the first non-trivial characterization of NPℝ by real PCPℝ-classes. As a byproduct this result implies as well a characterization of real nondeterministic exponential time via NEXPℝ = PCPℝ(poly(n), poly(n)).
Partially supported by DFG project ME 1424/7-1.
This is a preview of subscription content, log in via an institution to check access.
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. Journal of the ACM 45(3), 501–555 (1998); Preliminary version: Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, 14–23 (1992)
Arora, S., Safra, S.: Probabilistic checking proofs: A new characterization of NP.. Journal of the ACM 45(1), 70–122 (1998); Preliminary version: Proc. of the 33rd Annual IEEE Symposium on the Foundations of Computer Science, 2–13 (1992)
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)
Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity 1, 3–40 (1990)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)
Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. 21, 1–46 (1989)
Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM 54(3) (2007)
Friedl, K., Hátsági, Z., Shen, A.: Low-degree tests. In: Proc. SODA, pp. 57–64 (1994)
Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. Journal of the ACM 39(4), 859–868 (1992)
Meer, K.: Transparent long proofs: A first PCP theorem for NPℝ. Foundations of Computational Mathematics 5(3), 231–255 (2005)
Meer, K.: On some relations between approximation problems and PCPs over the real numbers. Theory of Computing Systems 41, 107–118 (2007)
Rubinfeld, R., Sudan, M.: Self-testing polynomial functions efficiently and over rational domains. In: Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 23–32. ACM, Orlando (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meer, K. (2011). Almost Transparent Short Proofs for NPℝ . In: Owe, O., Steffen, M., Telle, J.A. (eds) Fundamentals of Computation Theory. FCT 2011. Lecture Notes in Computer Science, vol 6914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22953-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-22953-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22952-7
Online ISBN: 978-3-642-22953-4
eBook Packages: Computer ScienceComputer Science (R0)