Preprint
Aug 2026
Can LLMs be Used to Simplify Algorithms? Simpler Algorithms for Vertex Coloring and Edge Connectivity
This paper studies how well LLMs can simplify algorithms by evaluating three different LLMs on ten different algorithmic problems, and results in the discovery of two novel algorithms.
Antoine El-Hayek, Monika Henzinger, D. Zheng
· 1 citation