A probabilistic algorithm for $k$-SAT and constraint satisfaction problems

Uwe Schöning
Proc. 40th Symp. Foundations of Computer Science, IEEE, Oct 1999, pp. 410–414

Cites:

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