First Page | Document Content | |
---|---|---|
Date: 2012-05-30 08:53:38Computational complexity theory Cryptography Theory of computation Probabilistic complexity theory IP Zero-knowledge proof Soundness PP Entropy NP Randomized algorithm Interactive proof system | An Efficient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grantAdd to Reading ListSource URL: www.nada.kth.seDownload Document from Source WebsiteFile Size: 287,66 KBShare Document on Facebook |
Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014DocID: 1rrqu - View Document | |
Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.DocID: 1rgOi - View Document | |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1rgbF - View Document | |
Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN ByDocID: 1rdMz - View Document | |
Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995DocID: 1raDV - View Document |