Lecture 23: Probabilistic Computation, BPP

Name: Lecture 23: Probabilistic Computation, BPP
Uploaded: 2021-10-06T12:44:45Z
Duration: 1 h 23 min 41 s
Description: Description: Quickly reviewed last lecture. Defined probabilistic Turing machines and the class BPP. Sketched the amplification lemma. Introduced branching programs and read-once branching programs. Started the proof that \(EQ\) ROBP ∈ BPP. Introduced the arithmetization method. Instructor: Prof. Michael Sipser

1:23:41

Description: Quickly reviewed last lecture. Defined probabilistic Turing machines and the class BPP. Sketched the amplification lemma. Introduced branching programs and read-once branching programs. Started the proof that \(EQ\)_ROBP ∈ BPP. Introduced the arithmetization method.

Instructor: Prof. Michael Sipser