Hirsch (3-Graph Coloring Graph Coloring)
Jump to navigation
Jump to search
Time Complexity
$O({1.239}^n)$
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1998
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.5555/314613.314838