Terlaky's Criss-cross algorithm ( Linear Programming)
Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n*poly(n, m))$? (previously $O({2}^n)$) == Space Complexity == $O(nm)$ words (can be easily derived?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1985 == Reference == -")
Time Complexity
$O({2}^n*poly(n, m))$? (previously $O({2}^n)$)
Space Complexity
$O(nm)$ words
(can be easily derived?)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1985
Reference
-