A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Beyond the square-root exponent for depth-three circuits
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Color the Plane <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:algorithms, speed Levels:1
Category:Theoretical computer science Lean version:YES! ✔
Rate this game! 4.9 out of 5 (1,241 votes)

>>> How to Play <<<
Beyond the square-root exponent for depth-three circuits. Constructs a single language in deterministic polynomial time whose n-bit membership function requires $2^{\omega(\sqrt n)}$ 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.

>>> Level Select <<<
released 2026-09-23  |  1 theorem · 4 lemmas · 7 proofs · 8,574 words  |  PLAY LEVEL 1 »  (pdf)
We construct a language in deterministic polynomial time whose n-bit membership function requires $2^{\omega(\sqrt n)}$ gates in an unbounded-fan-in OR–AND–OR circuit. The bound holds at every sufficiently large input length and counts all gates, including the bottom layer.

More Theoretical computer science Games!
Exponential semidefinite complexity of perfect matchingThe asymptotic Gotsman–Linial conjectureA factor-two approximation for shortest common superstringExponential state costs for two-way automata
Fourier transforms below $n\log n$ HOT!Polynomial mixing of graph switches with prescribed degreesA counterexample to the quadratic sensitivity conjectureThe complexity of Weisfeiler–Leman refinement

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games