首页 > Term: probabilistically checkable proof
probabilistically checkable proof
An interactive proof system in which provers follow a fixed strategy, that is, one not affected by any messages from the verifier. The prover's strategy for a given instance x of a decision problem can be represented by a finite oracle language Bx, which constitutes a proof of the correct answer for x.
0
创建者
- GeorgeV
- 100% positive feedback