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 |