ConceptTheory & Algos
Circuit lower bounds
Lower bounds on the size of Boolean circuits required to compute specific functions.
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
1Ryan O'Donnell
Lectures that assume it
4Connections
15The lectures that define it or assume it, and the concepts next to it.
Concepts8
- Circuit complexity
- Boolean circuit
- Parity language
- Natural proofs
- Hardness versus randomness
- Hardness vs randomness paradigm