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:
3-coloring in time $O(1.3446^n)$: a no-MIS algorithm
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
