Terlaky's Criss-cross algorithm ( Linear Programming): Difference between revisions
Jump to navigation
Jump to search
(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 == -") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O({2}^n*poly(n, m))$ | $O({2}^n*poly(n, m))$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:33, 10 April 2023
Time Complexity
$O({2}^n*poly(n, m))$
Space Complexity
$O(nm)$ words
(can be easily derived?)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1985
Reference
-