Lecture 2: Doubly Efficient Interactive Proofs, Part 1

Name: Lecture 2: Doubly Efficient Interactive Proofs, Part 1
Uploaded: 2025-01-29T15:20:07Z
Duration: 1 h 53 min 23 s
Description: 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).

1:53:23

Up Next

Lecture 2: Doubly Efficient Interactive Proofs, Part 2

Continue

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