A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version)

Jonathan A. Kelner, Daniel A. Spielman. A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version). Electronic Colloquium on Computational Complexity (ECCC), (156), 2005. [doi]

@article{ECCC-TR05-156,
  title = {A Randomized Polynomial-Time Simplex Algorithm for Linear Programming (Preliminary Version)},
  author = {Jonathan A. Kelner and Daniel A. Spielman},
  year = {2005},
  url = {http://eccc.hpi-web.de/eccc-reports/2005/TR05-156/index.html},
  tags = {programming},
  researchr = {https://researchr.org/publication/ECCC-TR05-156},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  number = {156},
}