How NP got a new definition: a survey of probabilistically checkable proofs
Computational Complexity
2008-12-15 v1
Abstract
We survey a collective achievement of a group of researchers: the PCP Theorems. They give new definitions of the class \np, and imply that computing approximate solutions to many \np-hard problems is itself \np-hard. Techniques developed to prove them have had many other consequences.
Cite
@article{arxiv.cs/0304038,
title = {How NP got a new definition: a survey of probabilistically checkable proofs},
author = {Sanjeev Arora},
journal= {arXiv preprint arXiv:cs/0304038},
year = {2008}
}