The resolution complexity of random graph $k$-colorability

Paul Beame, Joseph Culberson, David Geoffrey Mitchell, and Cristopher Moore
Tech. report TR04-012, Electronic Colloq. on Computational Complexity, 2004
http://eccc.uni-trier.de/eccc-reports/2004/TR04-012/

Cites:

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