Fourier–Motzkin elimination ( Linear Programming): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O((m/{4})$^{({2}^n)}) == Space Complexity == $O((m/{4})$*({2}^n)) words ((can be easily derived? you have that many inequalities)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O((m/{4})$ | $O((m/{4})$^{({2}^n)}) words | ||
((can be easily derived? you have that many inequalities)) | ((can be easily derived? you have that many inequalities)) | ||
Latest revision as of 08:30, 10 April 2023
Time Complexity
$O((m/{4})$^{({2}^n)})
Space Complexity
$O((m/{4})$^{({2}^n)}) words
((can be easily derived? you have that many inequalities))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1940
Reference
-