probabilistically checkable proof
type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof
Press Enter · cited answer in seconds
0 sources
probabilistically checkable proof
Summary
probabilistically checkable proof ranks in the top 2% of general entities by monthly Wikipedia readership (32 views/month).[1]
Key Facts
- probabilistically checkable proof's subclass of is recorded as mathematical proof[2].
- probabilistically checkable proof's Freebase ID is recorded as /m/02jcqc[3].
- probabilistically checkable proof's short name is recorded as {'lang': 'en', 'text': 'PCP'}[4].
- probabilistically checkable proof's Dictionary of Algorithms and Data Structures ID is recorded as probabilisticallyCheckableProof[5].
- probabilistically checkable proof's Microsoft Academic ID is recorded as 154587302[6].
- probabilistically checkable proof's Australian Educational Vocabulary ID is recorded as scot/15511[7].
Body
Works and Contributions
Things named for probabilistically checkable proof include PCP theorem[8], a theorem[9].
Why It Matters
probabilistically checkable proof ranks in the top 2% of general entities by monthly Wikipedia readership (32 views/month).[1] It has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.[10] It is known by 4 alternative names across languages and contexts.[11]