Lee and Sidford ( Linear Programming)

From Algorithm Wiki

Revision as of 09:33, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O((nnz(A) + n^{2}) n^{0.5})$

Space Complexity

$O(nm+n^{2})$?? words

(Same reasoning as ^)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2015

Reference

https://arxiv.org/abs/1503.01752

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Lee_and_Sidford_(_Linear_Programming)&oldid=47334"