New answers tagged ds.algorithms
-3
it might be a bit off-topic but even the interior-point methods do have an exponential worst-case complexity as proven in the following paper:
https://link.springer.com/article/10.1007/s10107-006-0044-x#citeas
so basically Linear Programming has an exponential worst-case complexity or am I getting this wrong?
Top 50 recent answers are included
