Hacker News
points by FlyingCanoe 3 days ago | 0 comments
For linear programing, the interior point method has a polynomial worst case.

It also not probabilistic, so linear programing is not rely a good example

[–] m-chrzan 2 days ago
Given the context, Animats probably was speaking of integer linear progamming, which is NP-complete.
[–] caughtinthought 2 days ago
And interior point is regularly outperformed by an exponential time algorithm (simplex) lol
Hacker News