Strong ETH holds for regular resolution
Chris Beck, Russell Impagliazzo · 2013
We obtain asymptotically sharper lower bounds on resolution complexity for k-CNF's than was known previously. We show that for any large enough k there are k-CNF's which require resolution width (1-~O(k-1/4))n, regular resolution size 2(1-~O(k-1/4))n, and general resolution size (3/2)(1-~O(k-1/4))n.