Sign inSign in

P/poly

The complexity class containing all languages decidable by polynomial-size circuit families.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 5 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.

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

    A complexity class containing decision problems that can be solved by polynomial-size boolean circuit families.
    • 44:34BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 17:35Computational Models: Circuits
    • 9:17Circuits
    • 1:13:48Probabilistic Complexity Classes

Lectures that assume it

1

Connections

14

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.