Back to Results
First PageMeta Content
Computational 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 grant
Add to Reading List

Document Date: 2012-05-30 08:53:38


Open Document

File Size: 287,66 KB

Share Result on Facebook
UPDATE