<--- Back to Details
First PageDocument Content
Complexity classes / Mathematical proofs / Probabilistic complexity theory / Mathematical optimization / Interactive proof system / NP / Probabilistically checkable proof / IP / P versus NP problem / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2003-04-15 15:57:54
Complexity classes
Mathematical proofs
Probabilistic complexity theory
Mathematical optimization
Interactive proof system
NP
Probabilistically checkable proof
IP
P versus NP problem
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: groups.csail.mit.edu

Download Document from Source Website

File Size: 2,09 MB

Share Document on Facebook

Similar Documents

Computational complexity theory / Complexity classes / IP / Proof of knowledge / NP / Soundness / Interactive proof system / PSPACE / Zero-knowledge proof / Probabilistic complexity theory / Mathematical proof / Quadratic residue

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

DocID: 1rgbF - View Document

Cryptography / Polynomials / Probabilistic complexity theory / IP / Commitment scheme / NP / Interactive proof system / Zero-knowledge proof / Polynomial interpolation / Polynomial / Random self-reducibility / Permutation polynomial

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

DocID: 1raDV - View Document

Cryptography / Zero-knowledge proof / IP / Distribution / Computational complexity theory / Interactive proof system / Proof of knowledge

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

DocID: 1r8mX - View Document

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

DocID: 1qOst - View Document

Cryptography / IOS jailbreaking / SHSH blob / Commitment scheme / IP / Interactive proof system / Boolean algebra / Challengeresponse authentication

JOURNAL OF COMPUTER AND SYSTEM SCIENCES

DocID: 1qf4Y - View Document