Fomin; Gaspers & Saurabh (: Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O({1.6262}^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") |
No edit summary Tag: Manual revert |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O({1. | $O({1.9464}^n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:53, 10 April 2023
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