Lecture notes on the complexity of some problems in number the6 In particular, the idea of multi-prover interactive proofs of Benor, Goldwasser, Kilian, and Wigderson [15] (which has become better known as probabilistic checkable proofs) has led to a rice (1982)

by D Angluin