Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Reichman University
1
0
0
Replacing an impenetrable AI-generated proof that stumped theorists, this short note establishes the first verified $\Omega(n^2)$ determinantal complexity lower bound for an explicit polynomial.