PCP (計算複雑性理論)
1. Probabilistically checkable proofIn computational complexity theory, a probabilistically checkable proof (PCP) is a 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. The algorithm is then required to accept correct proofs and reject incorrect proofs with very high probability.
Read “Probabilistically checkable proof” on English Wikipedia
Read “PCP (計算複雑性理論)” on Japanese Wikipedia
Read “Probabilistically checkable proof” on DBpedia
Read “Probabilistically checkable proof” on English Wikipedia
Read “PCP (計算複雑性理論)” on Japanese Wikipedia
Read “Probabilistically checkable proof” on DBpedia
Discussions
Log in to talk about this word.