Monady’s class: Probabilistic Turing machines
Posted by James Lee on May 25, 2011
On Monday, we discussed the definition of BPP (bounded-error probabilistic polynomial time), and saw the proof of the Schwartz-Zippel Lemma (click on the link to see the proof).
