Exhaustive search (The Vertex Cover Problem The Vertex Cover Problem)
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(C(n, k)$) (i.e. (n, k) binomial coefficient) == Space Complexity == $O(k)$ auxiliary words (Just need to keep track of current subset being checked) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==")
Time Complexity
$O(C(n, k)$) (i.e. (n, k) binomial coefficient)
Space Complexity
$O(k)$ auxiliary words
(Just need to keep track of current subset being checked)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1940