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]
['Klaus Meer']
On some relations between approximation problems and PCPs over the real numbers