Theoretical computer science · Oct 6, 2026
Beyond the square-root exponent for depth-three circuits
Constructs a single language in deterministic polynomial time whose n-bit membership function requires total gates in unbounded-fan-in OR–AND–OR circuits, at every sufficiently large input length. This crosses the square-root-exponent threshold for explicit depth-three Boolean circuit lower bounds.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model