How NP got a new definition: a survey of probabilistically checkable proofs

Simple item page
dc.creatorArora, Sanjeev
dc.date2003-04-28
dc.date.accessioned2026-07-07T12:12:31Z
dc.date.available2026-07-07T12:12:31Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0304038
dc.identifierhttp://arxiv.org/abs/cs/0304038
dc.identifierProceedings of the ICM, Beijing 2002, vol. 3, 637--648
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210567
dc.subjectComputational Complexity
dc.subject68Q10, 68Q15, 68Q17, 68Q25
dc.subjectF.1
dc.titleHow NP got a new definition: a survey of probabilistically checkable proofs
dc.typetext

Files

Collections

arXiv