Koivisto ( Chromatic Polynomial)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

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

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2006

Reference

https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4031393