Lee and Sidford ( Linear Programming): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O((nnz(A) + n^{2}) n^{0.5})$ == Space Complexity == $O(nm+n^{2})$?? words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2015 == Reference == https://arxiv.org/abs/1503.01752") |
No edit summary |
||
| Line 7: | Line 7: | ||
$O(nm+n^{2})$?? words | $O(nm+n^{2})$?? words | ||
() | (Same reasoning as ^) | ||
== Description == | == Description == | ||
Latest revision as of 08:33, 10 April 2023
Time Complexity
$O((nnz(A) + n^{2}) n^{0.5})$
Space Complexity
$O(nm+n^{2})$?? words
(Same reasoning as ^)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2015