First Page | Document Content | |
---|---|---|
Date: 2017-10-16 18:20:55Mathematics Complexity classes Randomized algorithms IP Probabilistically checkable proof NP NEXPTIME Soundness Variable Interactive proof system Proof of knowledge | COSC 544 Probabilistic Proof SystemsA State of the Art MIP For Circuit Satisfiability Lecturer: Justin ThalerAdd to Reading ListSource URL: people.cs.georgetown.eduDownload Document from Source WebsiteFile Size: 127,88 KBShare Document on Facebook |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1rgbF - View Document | |
Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995DocID: 1raDV - View Document | |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1r8mX - View Document | |
An Efficient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grantDocID: 1qOst - View Document | |
JOURNAL OF COMPUTER AND SYSTEM SCIENCESDocID: 1qf4Y - View Document |