<--- Back to Details
First PageDocument Content
Complexity classes / Cryptographic protocols / Probabilistic complexity theory / Models of computation / Interactive proof system / Zero-knowledge proof / NP / IP / Arthur–Merlin protocol / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2014-03-23 11:48:58
Complexity classes
Cryptographic protocols
Probabilistic complexity theory
Models of computation
Interactive proof system
Zero-knowledge proof
NP
IP
Arthur–Merlin protocol
Theoretical computer science
Computational complexity theory
Applied mathematics

Proofs that Yield All Languages Proof

Add to Reading List

Source URL: nakamotoinstitute.org

Download Document from Source Website

File Size: 2,90 MB

Share Document on Facebook

Similar Documents

Computational complexity theory / Cryptography / Complexity classes / Theory of computation / NP / IP / Advice / PP / P / Soundness / Commitment scheme / Certificate

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

DocID: 1xUdf - View Document

Quantum mechanics / Physics / Theoretical physics / Chemistry / Mathematical formulation of quantum mechanics / Quantum superposition / Unitary transformation / Quantum computing / Hamiltonian / Quantum algorithm / Degenerate energy levels / Schrdinger equation

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

DocID: 1xTKi - View Document

PDF Document

DocID: 1xSVG - View Document

PDF Document

DocID: 1xSM6 - View Document

PDF Document

DocID: 1xSJs - View Document