Vaidya ( Linear Programming): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(((m+n)$n^{2}+(m+n)^{1.5}*n)L^{2} logL loglogL) == Space Complexity == $O((nm+n^{2})$L)? words (can be easily derived?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1987 == Reference == https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF01580859") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O | $O((m+n)$^{1.5}*n*L^{2} logL loglogL) | ||
== Space Complexity == | == Space Complexity == | ||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
1989 | |||
== Reference == | == Reference == | ||
https:// | https://ieeexplore.ieee.org/document/63499 | ||
Revision as of 11:17, 15 February 2023
Time Complexity
$O((m+n)$^{1.5}*n*L^{2} logL loglogL)
Space Complexity
$O((nm+n^{2})$L)? words
(can be easily derived?)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1989
Reference
https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/63499