Back to Results
First PageMeta Content
Complexity classes / Randomized algorithms / Computational complexity theory / Interactive proof system / Theoretical computer science / Mathematics / Zero-knowledge proof / Probabilistically checkable proof / Computer science / IP / ArthurMerlin protocol / NP


ON INTERACTIVE PROOFS WITH A LACONIC PROVER Oded Goldreich, Salil Vadhan, and Avi Wigderson Abstract. We continue the investigation of interactive proofs with bounded communication, as initiated by Goldreich and Hastad
Add to Reading List

Document Date: 2003-06-27 08:43:01


Open Document

File Size: 635,64 KB

Share Result on Facebook
UPDATE