Bjorklund, Husfeldt, Proposition 2 ( 5 - Graph Coloring)
Jump to navigation
Jump to search
Time Complexity
$O({2.2461}^n)$
Space Complexity
$O(poly(n)$) words
(https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4031392)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2006
Reference
https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4031392