Probabilistically checkable proofs and their consequences for approximation algorithms Original Research Article

The aim of this paper is to present a self-contained proof of the spectacular recent achievement that NP = PCP (log n, 1). We include, as consequences, results concerning nonapproximability of the clique number, as well as of the chromatic number of graphs, and of MAX-SNP hard problems.