A subexponential bound for linear programming

This publication has 24 references indexed in Scilit:

• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
  Journal of Algorithms, 1996
• Las Vegas algorithms for linear and integer programming when the dimension is small
  Journal of the ACM, 1995
• Helly-type theorems and Generalized Linear Programming
  Discrete & Computational Geometry, 1994
• Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem
  Published by Association for Computing Machinery (ACM) ,1994
• A class of convex programs with applications to computational geometry
  Published by Association for Computing Machinery (ACM) ,1992
• New applications of random sampling in computational geometry
  Discrete & Computational Geometry, 1987
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
  SIAM Journal on Computing, 1986
• Linear programming in O(n × 3d) time
  Information Processing Letters, 1986
• A Theorem Concerning the Integer Lattice
  Studies in Applied Mathematics, 1977
• Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden
  Archiv der Mathematik, 1957