Construct · 1 fields · 1 citations

PCP theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
PCP theorem1 CONSTRUCTPCP theoremARORA · COMPUTATIONAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the result that every NP statement has a proof that can be checked by reading only a few random bits, implying hardness of approximation.

In computational complexity, PCP theorem refers to the result that every NP statement has a proof that can be checked by reading only a few random bits, implying hardness of approximation. This meaning comes from Arora (1998) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how PCP theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructshardness of approximation1 fields · 1 citationsanchor · a standalone constructhardness4 fields · 4 citationsjingle · one word, four constructs

References

  1. Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998). Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3), 501-555. https://doi.org/10.1145/278298.278306

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct