Algorithms for SAT and upper bounds on their complexity

Evgeny Dantsin, Edward A. Hirsch, Sergei Ivanov, and Maxim Vsemirnov
Tech. report TR01-012, Electronic Colloq. on Computational Complexity, Feb 2001
ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2001/TR01-012/index.html

Cites:

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