Zamir ( 5 - Graph Coloring)
Jump to navigation
Jump to search
Time Complexity
$O(({2}-eps)$^n) for some eps>{0}
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2021
Reference
https://drops.dagstuhl.de/opus/volltexte/2021/14182/pdf/LIPIcs-ICALP-2021-113.pdf