The Resolution Complexity of Random Graph k-Colorability

Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore. The Resolution Complexity of Random Graph k-Colorability. Electronic Colloquium on Computational Complexity (ECCC), (012), 2004. [doi]

Abstract

Abstract is missing.