A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function.

Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov

Browse the full FOCS paper archive.