On Some Relations Between Approximation Problems and PCPs over the Real Numbers

  • Klaus Meer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3526)


In [7] it was recently shown that NP ⊆ PCR(poly, O(1)) i.e.the existence of transparent long proofs for NP was established. The latter denotes the class of real number decision problems verifiable in polynomial time as introduced by Blum, Shub and Smale [6]


Polynomial Time Approximation Problem Polynomial System Common Zero Polynomial Time Approximation Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arora, S., Lund, C.: Hardness of Approximation. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-hard problems, pp. 399–446. PWS Publishing, Boston (1996)Google Scholar
  2. 2.
    Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. In: Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science, pp. 14–23. IEEE Computer Society, Los Alamitos (1992)CrossRefGoogle Scholar
  3. 3.
    Arora, S., Safra, S.: Probabilistic checking proofs: A new characterization of NP. Journal of the ACM 45, 70–122 (1998); Preliminary version: Proc. of the 33rd Annual IEEE Symposium on the Foundations of Computer Science, pp. 2–13 (1992) Google Scholar
  4. 4.
    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)zbMATHGoogle Scholar
  5. 5.
    Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)Google Scholar
  6. 6.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Meer, K.: Transparent long proofs: A first PCP theorem for NP. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 959–970. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Meer, K.: Probabilistically checkable proofs over the reals. To appear in: Electronic Notes in Theoretical Computer ScienceGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Klaus Meer
    • 1
  1. 1.Department of Mathematics and Computer ScienceSyddansk UniversitetOdense MDenmark

Personalised recommendations