Introduction to the Theory of Computation

CSE 431, Spring 2011, University of Washington

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).

About these ads

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

 
Follow

Get every new post delivered to your Inbox.

%d bloggers like this: