Transparent long proofs: A first PCP theorem for \(\text{NP}_{\mathbb R}\)

DOI10.1007/S10208-005-0142-1zbMath1100.68034OpenAlexW2131508685MaRDI QIDQ2505647

Klaus Meer

Publication date: 28 September 2006

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10208-005-0142-1

zbMATH Keywords

probabilistically checkable proofs

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)

Related Items (5)

An algebraic proof of the real number PCP theorem ⋮ An Algebraic Proof of the Real Number PCP Theorem ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Almost Transparent Short Proofs for NPℝ ⋮ The PCP theorem for NP over the reals

This page was built for publication: Transparent long proofs: A first PCP theorem for \(\text{NP}_{\mathbb R}\)