<--- Back to Details
First PageDocument Content
Mathematics / Computational complexity theory / Algebra / IP / Polynomials / Interactive proof system / NP / Cryptography / Splitting circle method
Date: 2017-09-18 12:17:52
Mathematics
Computational complexity theory
Algebra
IP
Polynomials
Interactive proof system
NP
Cryptography
Splitting circle method

COSC 544 Probabilistic Proof SystemsThe Sum-Check Protocol Lecturer: Justin Thaler

Add to Reading List

Source URL: people.cs.georgetown.edu

Download Document from Source Website

File Size: 97,22 KB

Share Document on Facebook

Similar Documents

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1rgbF - View Document

Locally Random Reductions: Improvements and Applications  D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995

Locally Random Reductions: Improvements and Applications  D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995

DocID: 1raDV - View Document

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 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 grant

An Efficient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant

DocID: 1qOst - View Document

JOURNAL  OF COMPUTER AND SYSTEM SCIENCES

JOURNAL OF COMPUTER AND SYSTEM SCIENCES

DocID: 1qf4Y - View Document