A subexponential bound for linear programming

@article{Matousek1992ASB,
  title={A subexponential bound for linear programming},
  author={Jir{\'i} Matousek and Micha Sharir and Emo Welzl},
  journal={Algorithmica},
  year={1992},
  volume={16},
  pages={498-516}
}
We present a simple randomized algorithm which solves linear programs with <italic>n</italic> constraints and <italic>d</italic> variables in expected <italic>O</italic>(<italic>nde</italic><supscrpt>(<italic>d</italic> ln(<italic>n</italic>+1))<supscrpt>1/4</supscrpt></supscrpt>) time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input). The expectation is over the internal randomizations performed by the algorithm, and holds for any input… CONTINUE READING
Highly Influential
This paper has highly influenced 42 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS