On the probabilistic complexity of finding an approximate solution for linear programming

Jun Ji, Florian A. Potra. On the probabilistic complexity of finding an approximate solution for linear programming. J. Complexity, 24(2):214-227, 2008. [doi]

@article{JiP08,
  title = {On the probabilistic complexity of finding an approximate solution for linear programming},
  author = {Jun Ji and Florian A. Potra},
  year = {2008},
  doi = {10.1016/j.jco.2007.05.001},
  url = {http://dx.doi.org/10.1016/j.jco.2007.05.001},
  tags = {programming},
  researchr = {https://researchr.org/publication/JiP08},
  cites = {0},
  citedby = {0},
  journal = {J. Complexity},
  volume = {24},
  number = {2},
  pages = {214-227},
}