Comment by FlyingCanoe
8 hours ago
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
8 hours ago
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
Given the context, Animats probably was speaking of integer linear progamming, which is NP-complete.
And interior point is regularly outperformed by an exponential time algorithm (simplex) lol