alt Hacker NewsFor linear programing, the interior point method has a polynomial worst case.
It also not probabilistic, so linear programing is not rely a good example
Replies
caughtinthought • today at 9:18 AM
And interior point is regularly outperformed by an exponential time algorithm (simplex) lol
Given the context, Animats probably was speaking of integer linear progamming, which is NP-complete.