The unreasonable effectiveness of alternation-based satisfiability algorithms
Tom Morrisette
Electronic Notes in Discrete Mathematics
9, 2001
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
