Chen; I. Kanj; and W. Jia. (The Vertex Cover Problem The Vertex Cover Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O({1.2738}^k+ kn)$ == Space Complexity == $O(poly(n))$ words (https://www.cs.lafayette.edu/~gexia/research/mfcs06.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2006 == Reference == https://www.cs.lafayette.edu/~gexia/research/mfcs06.pdf") |
No edit summary Tag: Manual revert |
| (5 intermediate revisions by the same user not shown) | |
(No difference)
| |
Latest revision as of 09:33, 28 April 2023
Time Complexity
$O({1.2738}^k+ kn)$
Space Complexity
$O(poly(n))$ words
(https://www.cs.lafayette.edu/~gexia/research/mfcs06.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2006