New upper bounds for maximum satisfiability
Rolf Niedermeier
and
Peter Rossmanith
J. Algorithms
36(1):63–88, Jul 2000
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
