Worst-case analysis, 3-SAT decision and lower bounds: approaches for improved SAT algorithms

Oliver Kullmann
Satisfiability Problem: Theory and Applications, DIMACS Ser. Discrete Math. and Theoretical Computer Science 35, Ding-Zhu Du, Jun Gu, and Panos M. Pardalos, ed., Amer. Math. Soc., 1997, pp. 261–313
http://cs-svr1.swan.ac.uk/~csoliver/Artikel/procfin2e.ps

Cites:

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