First Page | Document Content | |
---|---|---|
Date: 2010-03-21 22:20:21Cryptography Computational complexity theory Complexity classes Interactive proof system Zero-knowledge proof NP Probabilistically checkable proof IP Soundness Commitment scheme NEXPTIME P versus NP problem | The Complexity of Zero Knowledge Salil Vadhan∗ School of Engineering and Applied Sciences Harvard University Cambridge, MA 02138Add to Reading ListSource URL: people.seas.harvard.eduDownload Document from Source WebsiteFile Size: 202,09 KBShare Document on Facebook |
Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.DocID: 1rgOi - View Document | |
SelectNet_Manual_v2_April_2012.pdfDocID: 1qMoc - View Document | |
WV Public Employees Insurance Agency Frequently Asked Questions on Picking a Primary Care Provider Q. Why is PEIA making me pick a physician?DocID: 1qjEP - View Document | |
Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192.DocID: 1oP1q - View Document | |
Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004DocID: 1mroB - View Document |