One fixed polynomial-time Boolean language has exact depth-three OR–AND–OR circuit size greater than 2^(A√n) for every fixed A>0 at all sufficiently large input lengths n.
One fixed polynomial-time Boolean language has exact depth-three OR–AND–OR circuit size greater than 2^(A√n) for every fixed A>0 at all sufficiently large input lengths n.
One fixed polynomial-time Boolean language has exact depth-three OR–AND–OR circuit size greater than 2^(A√n) for every fixed A>0 at all sufficiently large input lengths n.
If correct, breaks the square-root-constant barrier for unrestricted-fan-in depth-three Boolean circuits.
Can one fixed polynomial-time language beat every square-root-constant depth-three circuit lower bound?
Publication dates and editorial changes.
OpenAI reports a depth-three circuit lower bound beyond every square-root constant
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
