How NP got a new definition: a survey of probabilistically checkable proofs
Abstract
We survey a collective achievement of a group of researchers: the PCP Theorems. They give new definitions of the class , and imply that computing approximate solutions to many -hard problems is itself -hard. Techniques developed to prove them have had many other consequences.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.