An Algebraic Proof of the Real Number PCP Theorem

  • Martijn Baartse
  • Klaus MeerEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9235)


The PCP theorem has recently been shown to hold as well in the real number model of Blum, Shub, and Smale [3]. The proof given there structurally closely follows the proof of the original PCP theorem by Dinur [7]. In this paper we show that the theorem also can be derived using algebraic techniques similar to those employed by Arora et al. [1, 2] in the first proof of the PCP theorem. This needs considerable additional efforts. Due to severe problems when using low-degree algebraic polynomials over the reals as codewords for one of the verifiers to be constructed, we work with certain trigonometric polynomials. This entails the necessity to design new segmentation procedures in order to obtain well structured real verifiers appropriate for applying the classical technique of verifier composition.

We believe that designing as well an algebraic proof for the real PCP theorem on one side leads to interesting questions in real number complexity theory and on the other sheds light on which ingredients are necessary in order to prove an important result like the PCP theorem in different computational structures.



We thank an anonymous referee for his/her very careful reading and comments.


  1. 1.
    Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. J. ACM 45(3), 501–555 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Arora, S., Safra, S.: Probabilistic checking proofs: A new characterization of \(NP\). J. ACM 45(1), 70–122 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Baartse, M., Meer, K.: The PCP theorem for NP over the reals. Foundations of Computational Mathematics 15(3), 651–680 (2015). (Springer)Google Scholar
  4. 4.
    Baartse, M., Meer, K.: Topics in real and complex number complexity theory. In: Montana, J.L., Pardo, L.M. (eds.) Recent Advances in Real Complexity and Computation, Contemporary Mathematics, vol. 604, pp. 1–53. American Mathematical Society (2013)Google Scholar
  5. 5.
    Baartse, M., Meer, K.: Testing low degree trigonometric polynomials. In: Hirsch, E.A., Kuznetsov, S.O., Pin, J.É., Vereshchagin, N.K. (eds.) CSR 2014. LNCS, vol. 8476, pp. 77–96. Springer, Heidelberg (2014) Google Scholar
  6. 6.
    Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)Google Scholar
  7. 7.
    Dinur, I.: The PCP theorem by gap amplification. J. ACM 54(3), 12 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859–868 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Meer, K.: Transparent long proofs: A first PCP theorem for NP\(_\mathbb{R}\). Found. Comput. Math. 5(3), 231–255 (2005). (Springer)Google Scholar
  10. 10.
    Meer, K.: Almost transparent short proofs for NP\(_\mathbb{R}\). In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 41–52. Springer, Heidelberg (2011) CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Computer Science InstituteBTU Cottbus-SenftenbergCottbusGermany

Personalised recommendations