Proofs that Yield All Languages Proof

First Page		Document Content
Date: 2014-03-23 11:48:58 Complexity classes Cryptographic protocols Probabilistic complexity theory Models of computation Interactive proof system Zero-knowledge proof NP IP Arthur–Merlin protocol Theoretical computer science Computational complexity theory Applied mathematics		Proofs that Yield All Languages Proof Add to Reading List Source URL: nakamotoinstitute.org Download Document from Source Website File Size: 2,90 MB Share Document on Facebook

	On Quantum Interactive Proofs with Short Messages DocID: 13NSI - View Document
	Monday, July 17 9:30-10:30 G¨ odel and Computations, Pavel Pudlak 10:30-11:00 Coffee 11:00-11:30 Polynomial Identity Testing for Depth 3 Circuits, Neeraj Kayal, Nitin Saxena DocID: 13fgr - View Document
	Proofs that Yield All Languages Proof DocID: 132BP - View Document
	QMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson∗ University of Waterloo Abstract DocID: Qoyk - View Document
	On the Power of a Unique Quantum Witness DocID: nhgH - View Document