Sign inSign in

Approximate counting

The problem of estimating the number of solutions to a computational problem within some approximation factor.
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.

AM (Arthur-Merlin complexity class)1Boolean circuit1Circuit SAT1Complexity classes1Hashing functions1Probability theory1Satisfiability1Sharp C1

Lecturers

1

    Connections

    3

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

    Concepts2

    Lecture1

    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.