<--- 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

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

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

DocID: 1xUdf - View Document

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

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