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

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

Ryan O'Donnell via YouTube Direct link

probabilistic Turing Machine

5 of 10

5 of 10

probabilistic Turing Machine

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

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

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Introduction
  2. 2 Why RP
  3. 3 Why not randomness
  4. 4 Questions
  5. 5 probabilistic Turing Machine
  6. 6 Randomness
  7. 7 Conditions
  8. 8 Nondeterminism
  9. 9 Error amplification
  10. 10 Randomized polynomial time

Never Stop Learning.

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

Someone learning on their laptop while sitting on the floor.