18.404J | Fall 2020 | Undergraduate, Graduate

Theory of Computation

Video Lectures

Lecture 24: Probabilistic Computation (cont.)

Description: Quickly reviewed last lecture. Simulated read-once branching programs by polynomials. Gave a probabilistic polynomial equality testing method. Concluded proving \(EQ\)ROBP ∈ BPP.

Instructor: Prof. Michael Sipser

Course Info

Learning Resource Types
Lecture Videos
Problem Sets
Exams
Lecture Notes
Instructor Insights