Affine scaling ( Linear Programming)

From Algorithm Wiki
Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == ? (originally $O(n^{3.5} L)$ but seems unclear) == Space Complexity == $O(nm+m^{2})$? words (can be easily derived?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1967 == Reference == -")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

? (originally $O(n^{3.5} L)$ but seems unclear)

Space Complexity

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

(can be easily derived?)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1967

Reference

-