{"version":"1.0","type":"link","title":"Probabilistically checkable proof - Newikis","description":"In 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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}