4 citations · 6 across the 8 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CC2021
Learning algorithms versus automatability of Frege systems
Ján Pich, Rahul Santhanam
We connect learning algorithms and algorithms automating proof search in propositional proof systems: for every sufficiently strong, well-behaved propositional proof system , we…
cs.CC2021
Pseudodeterministic Algorithms and the Structure of Probabilistic Time
Zhenjian Lu, Igor C. Oliveira, Rahul Santhanam
We connect the study of pseudodeterministic algorithms to two major open problems about the structural complexity of : proving hierarchy theorems and showing the e…