2 papers
cs.LG2026
Compile to Compress: Boosting Formal Theorem Provers by Compiler Outputs
Guchan Li, Rui Tian, Hongning Wang
Large language models (LLMs) have demonstrated significant potential in formal theorem proving, yet state-of-the-art performance often necessitates prohibitive test-time compute vi…
cs.DS2025
Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
Puhan Yang, Guchan Li
The rectilinear Steiner minimum tree (RSMT) problem computes the shortest network connecting a given set of points using only horizontal and vertical lines, possibly adding extra p…