Strongly Connected Components, Dominator Trees, Graph Analysis, Compiler Optimization
AC^0[p]-Frege Cannot Efficiently Prove that Constant-Depth Algebraic Circuit Lower Bounds are Hard
arxiv.org·11h
CompileBench: Can AI Compile 22-year-old Code?
simonwillison.net·19h
Proof Rules for MetaSMT
philipzucker.com·1d
Quartic Quantum Speedups for Planted Inference
journals.aps.org·2h
Loading...Loading more...