Sign inSign in

PP

A complexity class of decision problems solved by a probabilistic Turing machine in polynomial time with error strictly less than 1/2.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 3 definitions
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

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 1:10:23Instance Checking and the Permanent
    • 16:07Probabilistic Complexity Classes

Connections

7

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

1 lecturer. 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.