Terlaky's Criss-cross algorithm ( Linear Programming)

From Algorithm Wiki
Jump to navigation Jump to search

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

-