Cohen; Lee and Song ( Linear Programming): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{max(omega, {2.5}-alpha/{2}, {13}/{6})}*polylog(n, m, L))$, where omega is the exponent on matrix multiplication, alpha is the dual exponent of matrix multiplication; currently $O(n^{2.37285956})$ == Space Complexity == $O(nm+n^{2})$? words (can be easily derived?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2018 == Reference == https://ar...") |
No edit summary |
||
| Line 8: | Line 8: | ||
$O(nm+n^{2})$? words | $O(nm+n^{2})$? words | ||
( | (Not entirely sure about this, but it seems like each iteration manipulates a constant number of $O(m+n)\times O(n)$ matrices, along with a constant number of vectors of size $O(m+n)$, all of whose elements are of size $O(1)$ words.) | ||
== Description == | == Description == | ||
Latest revision as of 08:33, 10 April 2023
Time Complexity
$O(n^{max(omega, {2.5}-alpha/{2}, {13}/{6})}*polylog(n, m, L))$, where omega is the exponent on matrix multiplication, alpha is the dual exponent of matrix multiplication; currently $O(n^{2.37285956})$
Space Complexity
$O(nm+n^{2})$? words
(Not entirely sure about this, but it seems like each iteration manipulates a constant number of $O(m+n)\times O(n)$ matrices, along with a constant number of vectors of size $O(m+n)$, all of whose elements are of size $O(1)$ words.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2018