Sign inSign in

coRP

The class of languages whose complements are in RP, allowing false negative errors instead of false positive errors.
as Ryan O'Donnell 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.

RP2Complement language1Language1Polynomial time1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Venkatesan Guruswami

    Carnegie Mellon University · Undergraduate

    The class of languages whose complement is in RP.
    • 0:30BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class

Lectures that assume it

1

Connections

8

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

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.