No title
Atserias and Müller (JACM, 2020) proved that for every unsatisfiable CNF formula ℓ, the formula Ref(ℓ) stating that 'ℓ has small Resolution refutations"-does not have subexponential-size Resolution refutations. Conversely, when ℓ is satisfiable, Pudlák (TCS, 2003) showed how to construct a polynomial-size Resolution refutation of REF(ℓ) given a satisfying assignment of ℓ. A question that had remai
