Karmarkar's algorithm ( Linear Programming)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3.5} L^{2} logL loglogL)$
Space Complexity
$O(nmL)$ words
(can be derived from paper?)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1984