Lecture 2: Doubly Efficient Interactive Proofs, Part 1
This lecture covers topics including definition and examples of doubly efficient IP for counting triangles in a graph, low-degree extension, and doubly efficient IP for all bounded depth computations (the GKR protocol).
Course Info
Instructor
Departments
As Taught In
Fall
2023
Level
Learning Resource Types
theaters
Lecture Videos
