Lower bounds for k-DNF resolution on random 3-CNFs

Michael Alekhnovich. Lower bounds for k-DNF resolution on random 3-CNFs. In Harold N. Gabow, Ronald Fagin, editors, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. pages 251-256, ACM, 2005. [doi]

Abstract

Abstract is missing.