6
votes
Accepted
Strongly polynomial time algorithm for shortest convex combination
It is known via a paper of De Loera, Haddock and Rademacher that a strongly polynomial time algorithm for finding a minimum norm point in a simplex implies a strongly polynomial time algorithm for ...
- 6,763
Only top scored, non community-wiki answers of a minimum length are eligible