Khachiyan Ellipsoid algorithm ( Linear Programming)
Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (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")
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