Lower bounds for a subexponential optimization algorithm
- 11 October 1994
- journal article
- Published by Wiley in Random Structures & Algorithms
- Vol. 5 (4) , 591-607
- https://doi.org/10.1002/rsa.3240050408
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Smallest enclosing disks (balls and ellipsoids)Published by Springer Nature ,2017
- A subexponential bound for linear programmingPublished by Association for Computing Machinery (ACM) ,1992
- A subexponential randomized simplex algorithm (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- A subexponential algorithm for abstract optimization problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Small-dimensional linear programming and convex hulls made easyDiscrete & Computational Geometry, 1991
- Automatic average-case analysis of algorithmsTheoretical Computer Science, 1991
- A Las Vegas algorithm for linear programming when the dimension is smallPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Polynomial algorithms in linear programmingUSSR Computational Mathematics and Mathematical Physics, 1980