Foundations of Computational Mathematics

, Volume 5, Issue 3, pp 231–255 | Cite as

Transparent Long Proofs: A First PCP Theorem for NPR



We introduce and study the notion of probabilistically checkable proofs (PCP) for real number algorithms. Our starting point is the computational model of Blum, Shub, and Smale (BSS) and the real analogue NPR of NP in that model. We define in a straightforward manner verifiers as well as complexity classes PCPR(r(n),q(n)) for the BSS model. Our main result is, to the best of our knowledge, the first PCP theorem for NPR. It states that each problem in NPR has transparent long proofs, i.e.,NPR \subseteq PCPR(poly,1), where poly denotes the class of univariate polynomial functions. The techniques used extend ideas from [12] for self-testing and self-correcting certain functions over so-called rational domains to more general domains over the real numbers. The latter arise from the particular NPR-complete problem for which we construct a verifier of the required form.

Real number complexity Probabilistically checkable proofs Verifiers 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Society for the Foundations of Computational Mathematics 2005

Authors and Affiliations

  1. 1.Department of Mathematics and Computer Science, Syddansk Universitet, Campusvej 55, 5230 Odense MDenmark

Personalised recommendations