RECURSUM's LayeredCodegen produces C++ for recurrence relations that runs up to 9.8 times faster than expert hand-optimized code while matching accuracy within 3.3%.
Ragan-Kelley, C
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
RECURSUM: Automated Code Generation for Recurrence Relations Exceeds Expert Optimization via LayeredCodegen
RECURSUM's LayeredCodegen produces C++ for recurrence relations that runs up to 9.8 times faster than expert hand-optimized code while matching accuracy within 3.3%.