Bjorklund, Husfeldt, Theorem 1 ( 6 - Graph Coloring)

From Algorithm Wiki
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n*poly(n)$) == Space Complexity == $O({2}^n*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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2}^n*poly(n)$)

Space Complexity

$O({2}^n*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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bjorklund,_Husfeldt,_Theorem_1_(_6_-_Graph_Coloring)&oldid=45039"