Definitions from Wikipedia (PCP theorem)

▸ noun:  In computational complexity theory, the PCP theorem (also known as the PCP characterization theorem) states that every decision problem in the NP complexity class has probabilistically checkable proofs (proofs that can be checked by a randomized algorithm) of constant query complexity and logarithmic randomness complexity (uses a logarithmic number of random bits).


▸ Words similar to pcp theorem
▸ Usage examples for pcp theorem

▸ Idioms related to pcp theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near pcp theorem
▸ Rhymes of pcp theorem

▸ Invented words related to pcp theorem