OurBigBook About$ Donate
 Sign in Sign up

PCP theorem

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Discrete mathematics Theorems in discrete mathematics Theorems in computational complexity theory
 0 By others on same topic  0 Discussions Create my own version
The PCP (Probabilistically Checkable Proofs) theorem is a significant result in computational complexity theory that characterizes the class of decision problems that can be efficiently verified by a probabilistic verifier using a limited amount of randomness and reading only a small portion of the proof.

 Ancestors (6)

  1. Theorems in computational complexity theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook