BIRS Workshop Lecture Videos
k-Clique and Regular vs. General Resolution Pang, Shuo
For the average hardness of $k$-clique CNF, we have the $2^k$-type lower bound for general resolution, and the ideal $n^k$-type for regular resolution. What's difficult in getting the ideal lbd for general resolution Is regularity really important here We examine known separations of general vs. regular, and show that they actually all separate a middle model (called ``a-irregular'') from regular. It also turns out, $k$-Clique goes past (ie., is hard for) this model. Thus the difficulty comes from, not surprisingly, those ``very irregular'' proofs.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International