Sign inSign in

Randomized polynomial time

A complexity class for languages recognized by a probabilistic Turing machine in polynomial time with one-sided error.
as Venkatesan Guruswami defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    The class of languages decided by a randomized polynomial-time Turing machine with one-sided error.
    • 53:45Randomized Complexity: RP, coRP, and ZPP

Connections

7

The lectures that define it or assume it, and the concepts next to it.

Concepts5

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.