1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.LO2025
A Logspace-Constructive Proof of L=SL
Sam Buss, Anant Dhayal, Valentine Kabanets +2
We formalize the proof of Reingold's Theorem that SL=L [Rei05] in the theory of bounded arithmetic VL, which corresponds to ``logspace reasoning''. As a consequence, we get that VL…
cs.CL2024
Next-Token Prediction Task Assumes Optimal Data Ordering for LLM Training in Proof Generation
Chenyang An, Shima Imani, Feng Yao +8
In the field of large language model (LLM)-based proof generation, despite extensive training on large datasets such as ArXiv, LLMs still exhibit only modest performance on proving…
cs.LO2019★ 1 cited
DRAT and Propagation Redundancy Proofs Without New Variables
Sam Buss, Neil Thapen
We study the complexity of a range of propositional proof systems which allow inference rules of the form: from a set of clauses derive the set of clauses where…