Back
Add Comment
Topics
Vote
Results
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
--Agreed Upon Solutions

The discussion does not exist would you like to add the first comment?

anonymous