IAS

#	Item
1	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 Source URL: www.math.ias.edu Language: English - Date: 2003-06-27 08:43:01 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
2	PDF Document Add to Reading List Source URL: ias.ieee.org - Date: 2018-03-03 14:01:48
3	PDF Document Add to Reading List Source URL: ias.in.tum.de - Date: 2011-07-21 05:07:15
4	PDF Document Add to Reading List Source URL: ias.in.tum.de - Date: 2011-07-21 05:07:04
5	PDF Document Add to Reading List Source URL: ias.in.tum.de - Date: 2011-07-21 05:06:55
6	PDF Document Add to Reading List Source URL: ias.ieee.org - Date: 2018-04-18 05:56:49
7	PDF Document Add to Reading List Source URL: ias.in.tum.de - Date: 2011-07-21 05:06:55
8	PDF Document Add to Reading List Source URL: ias.in.tum.de - Date: 2011-07-21 05:07:13
9	PDF Document Add to Reading List Source URL: ias.in.tum.de - Date: 2011-07-21 05:06:38
10	PDF Document Add to Reading List Source URL: ias.ieee.org - Date: 2018-03-30 12:31:56