Fourier–Motzkin elimination ( Linear Programming)
Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (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 == -")
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
-