1 citations · 2 across the 3 of their papers we have counts for
1 paper · 1 filter
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-s proof in some proof system P. In the corresp…