How NP got a new definition: a survey of probabilistically checkable proofs
<|reference_start|>How NP got a new definition: a survey of probabilistically checkable proofs: 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.<|reference_end|>
@article{arora2003how,
    title={How NP got a new definition: a survey of probabilistically checkable
  proofs},
    author={Sanjeev Arora},
    journal={Proceedings of the ICM, Beijing 2002, vol. 3, 637--648},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0304038},
    primaryClass={cs.CC}
}