Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Undergrad Complexity at CMU - Randomized Complexity- RP, coRP, and ZPP

Ryan O'Donnell via YouTube

Start learning Write review
DataCamp Ad

AI Engineer - Learn how to integrate AI into software applications

Learn More → Boot.dev Ad

Learn Backend Development Part-Time, Online

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This lecture introduces randomized computation in complexity theory, using probabilistic Turing machines to define RP, coRP, and ZPP. It covers one-sided error, error amplification, and randomized polynomial time.

Syllabus

Introduction
Why RP
Why not randomness
Questions
probabilistic Turing Machine
Randomness
Conditions
Nondeterminism
Error amplification
Randomized polynomial time

Taught by

Ryan O'Donnell

Reviews

Start your review of Undergrad Complexity at CMU - Randomized Complexity- RP, coRP, and ZPP

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.