Strongly Connected Components, Dominator Trees, Graph Analysis, Compiler Optimization
Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
arxiv.org·4h
VerilogMonkey: Exploring Parallel Scaling for Automated Verilog Code Generation with LLMs
arxiv.org·4h
AC^0[p]-Frege Cannot Efficiently Prove that Constant-Depth Algebraic Circuit Lower Bounds are Hard
arxiv.org·4h
CompileBench: Can AI Compile 22-year-old Code?
simonwillison.net·12h
Loading...Loading more...