| Display title | PCP theorem |
| Default sort key | Quantum PCP theorem |
| Page length (in bytes) | 15,771 |
| Namespace ID | 0 |
| Page ID | 3001241 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 44 |
| Number of page watchers who visited in the last 30 days | 7 |
| Number of redirects to this page | 7 |
| Counted as a content page | Yes |
| Wikidata item ID | Q1140200 |
| Local description | Theorem in computational complexity theory |
| Central description | theorem in complexity theory that every problem in NP has probabilistically checkable proofs |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | SpaceMoose (talk | contribs) |
| Date of page creation | 07:03, 26 October 2005 |
| Latest editor | 2601:147:4900:db80:4619:45c9:c6b6:c7f8 (talk) |
| Date of latest edit | 19:23, 31 May 2025 |
| Total number of edits | 208 |
| Recent number of edits (within past 30 days) | 1 |
| Recent number of distinct authors | 1 |
| Hidden categories (4) | This page is a member of 4 hidden categories (help):
|
| Transcluded templates (66) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
