Lee and Sidford ( Linear Programming)

From Algorithm Wiki
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