(definition)

**Definition:**
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 B_{x}, which constitutes a proof of the correct answer for x.

*Note:
From Algorithms and Theory of Computation Handbook, page 29-20, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.*

Author: CRC-A

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.

HTML page formatted Mon Feb 2 13:10:40 2015.

Cite this as:

Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "probabilistically checkable proof", in
*Dictionary of Algorithms and Data Structures* [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/probabilisticallyCheckableProof.html