Jiang, Song, Weinstein and Zhang ( Linear Programming)
Jump to navigation
Jump to search
Time Complexity
$O(n^(max(omega, {2.5}-alpha/{2}, {37}/{18}))*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
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2020