Checking computations in polylogarithmic time
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC ’91
Mario Szegedy
Lance Fortnow
László Babai
Guest column
Two prover protocols