Abstract
IN THIS chapter we will give a complete proof of the PCP theorem, that Theorem 6.2. In particular, after a brief presentation of the main ingredients of a Pcp result, we first show that any NP problem admits long (that is, exponential) proofs which can be verified with a constant number of queries. To this aim we introduce the arithmetization of a Boolean formula and we make use of some properties of linear functions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ausiello, G., Marchetti-Spaccamela, A., Crescenzi, P., Gambosi, G., Protasi, M., Kann, V. (1999). The PCP theorem. In: Complexity and Approximation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58412-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-58412-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63581-6
Online ISBN: 978-3-642-58412-1
eBook Packages: Springer Book Archive