Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
Total Search Problems in
Noah Fleming, Stefan Grosser, Siddhartha Jain +4
We initiate a systematic study of , the class of total search problems solvable by polynomial time randomized algorithms. contains a variety o…
cs.CC2024
Finding Bugs in Short Proofs: The Metamathematics of Resolution Lower Bounds
Jiawei Li, Yuhao Li, Hanlin Ren
We study the *refuter* problems for proof complexity lower bounds. Suppose is a hard tautology that does not admit any length- proof in some proof system . In the corresp…