Proof — Circuit lower bounds
Statement
Groundbreaking work on lower bounds for circuit complexity. Proved in ZFC.
Proof sketch
ZFC → Boolean circuits as set-theoretic objects. Monotone circuit lower bounds via approximation method. Razborov–Smolensky technique.
Source
IMU Abacus Medal 1990. Groundbreaking work on lower bounds for circuit complexity. Proved in ZFC.
Domains
computer-science