1 citations · 1 across the 3 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
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.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…