Name: Lecture 24: Probabilistic Computation (cont.)
Uploaded: 2021-10-06T12:45:35Z
Duration: 1 h 23 min 16 s
Description: 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

1:23:16

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