BeaCulMit-ECCC-04

@techreport{BeaCulMit-ECCC-04,
title = {The resolution complexity of random graph $k$-colorability},
author = {Paul Beame and Joseph Culberson and David Geoffrey Mitchell and Cristopher Moore},
institution = {Electronic Colloq. on Computational Complexity},
number = {TR04-012},
year = {2004},
url = {http://eccc.uni-trier.de/eccc-reports/2004/TR04-012/}}

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!