PCP theorem (Q6480593)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: [[]] |
theorem in complexity theory that every problem in NP has probabilistically checkable proofs
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PCP theorem |
theorem in complexity theory that every problem in NP has probabilistically checkable proofs |
Statements
Identifiers
88606757
0 references
