History and Significance
The theory of probabilistically checkable proofs studies the power of probabilistically checkable proof systems under various restrictions of the parameters (completeness, soundness, randomness complexity, query complexity, and alphabet size). It has applications to computational complexity (in particular hardness of approximation) and cryptography.
The definition of a probabilistically checkable proof was explicitly introduced by Arora and Safra in 1992, although their properties were studied earlier. In 1990 Babai, Fortnow, and Lund proved that PCP = NEXP, providing the first nontrivial equivalence between standard proofs (NEXP) and probabilistically checkable proofs. The PCP theorem proved in 1992 states that PCP = NP.
The theory of hardness of approximation requires a detailed understanding of the role of completeness, soundness, alphabet size, and query complexity in probabilistically checkable proofs.
Read more about this topic: Probabilistically Checkable Proof
Famous quotes containing the words history and, history and/or significance:
“All objects, all phases of culture are alive. They have voices. They speak of their history and interrelatedness. And they are all talking at once!”
—Camille Paglia (b. 1947)
“Bias, point of view, fury—are they ... so dangerous and must they be ironed out of history, the hills flattened and the contours leveled? The professors talk ... about passion and point of view in history as a Calvinist talks about sin in the bedroom.”
—Catherine Drinker Bowen (1897–1973)
“History is the interpretation of the significance that the past has for us.”
—Johan Huizinga (1872–1945)