<--- Back to Details
First PageDocument Content
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
Date: 2015-02-25 05:09:48
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

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

Download Document from Web Archive

File Size: 132,05 KB