Fourier–Motzkin elimination ( Linear Programming)
Jump to navigation
Jump to search
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
-