Bjorklund, Husfeldt, Proposition 3 ( Chromatic Polynomial)

From Algorithm Wiki
Revision as of 10: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)$) => $O({1.292}^n)$ words (https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?arnumber=4031392) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2006 == Reference == https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/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)$) => $O({1.292}^n)$ words

(https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?arnumber=4031392)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2006

Reference

https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?arnumber=4031392

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Bjorklund,_Husfeldt,_Proposition_3_(_Chromatic_Polynomial)&oldid=45055"