Fomin; Gaspers & Saurabh (: Difference between revisions
Jump to navigation
Jump to search
No edit summary Tag: Reverted |
No edit summary Tag: Manual revert |
| (One intermediate revision by the same user not shown) | |
(No difference)
| |
Latest revision as of 09: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