Fomin; Gaspers & Saurabh (

From Algorithm Wiki
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs)
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