Fomin; Gaspers & Saurabh (

From Algorithm Wiki

Revision as of 09:53, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O({1.9464}^n)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2007

Reference

https://link.springer.com/chapter/10.1007/978-3-540-73545-8_9

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Fomin;_Gaspers_%26_Saurabh_(&oldid=47557"