“Almost optimal lower bounds for small depth circuits”

“Almost optimal lower bounds for small depth circuits” is a seminal theoretical computer science paper by Johan Håstad that establishes near-tight lower bounds on the size of constant-depth Boolean circuits, profoundly influencing circuit complexity theory.

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.