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

First Page		Document Content
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		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 Download Document from Source Website File Size: 635,64 KB Share Document on Facebook

	Lebesgue density and Π01 Classes Mushfeq Khan University of Hawai‘i at M¯anoa Algorithmic Randomness and Complexity Shonan Village Center September 12th, 2014 DocID: 1ubuP - View Document
	Rademacher Complexity Margin Bounds for Learning with a Large Number of Classes Vitaly Kuznetsov Courant Institute of Mathematical Sciences, 251 Mercer street, New York, NY, 10012 Mehryar Mohri DocID: 1t1hx - View Document
	Principles of metabolism: coping with complexity Six classes of enzymes DocID: 1sh47 - View Document
	Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester DocID: 1ruap - View Document
	The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University, DocID: 1rtIQ - View Document