Dinur & Steurer ( The Set-Covering Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2} log n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2013 == Reference == https://www.dsteurer.org/paper/productgames.pdf") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{2} log n)$ | $O(n^{2} \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 09:49, 10 April 2023
Time Complexity
$O(n^{2} \log n)$
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2013