Dinur & Steurer ( The Set-Covering Problem)
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (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")
Time Complexity
$O(n^{2} log n)$
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
2013