Lecture 2: Doubly Efficient Interactive Proofs, Part 2

Name: Lecture 2: Doubly Efficient Interactive Proofs, Part 2
Uploaded: 2025-01-29T15:19:55Z
Duration: 42 min 30 s
Description: This lecture continues the 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).

42:30

Up Next

Lecture 3: Continuation of the GKR Protocol and Corollaries

Continue

This lecture continues the 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).