Khachiyan Ellipsoid algorithm ( Linear Programming): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{6} * L^{2} logL loglogL)$ == Space Complexity == $O(nmL)$ words (see orginal paper (noting that O(alpha*log(H*alpha)) = O(L))) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1979 == Reference == https://www.sciencedirect.com/science/article/abs/pii/0041555380900610") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{6} * L^{2} | $O(n^{6} * L^{2} \log L \log\log L)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 07:53, 10 April 2023
Time Complexity
$O(n^{6} * L^{2} \log L \log\log L)$
Space Complexity
$O(nmL)$ words
(see orginal paper (noting that O(alpha*log(H*alpha)) = O(L)))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1979
Reference
https://www.sciencedirect.com/science/article/abs/pii/0041555380900610