Brute force ( The Set-Covering Problem)
Jump to navigation
Jump to search
Time Complexity
$O(U {2}^n)$
Space Complexity
$O(U)$ words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1972