On some relations between approximation problems and PCPs over the real numbers

Authors:
Klaus Meer
Affiliations:
Department of Mathematics and Computer Science, Syddansk Universitet, Odense M, Denmark
Venue:
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Year:
2005

Citing 6
Cited 1

Hardness of approximations

Approximation algorithms for NP-hard problems
Complexity and real computation

Complexity and real computation
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Proof verification and hardness of approximation problems

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Probabilistic checking of proofs; a new characterization of NP

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Probabilistically Checkable Proofs Over the Reals

Electronic Notes in Theoretical Computer Science (ENTCS)

Two logical hierarchies of optimization problems over the real numbers

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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]