Roman Vershynin. Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings. pages 133-142, IEEE Computer Society, 2006. [doi]
@inproceedings{Vershynin06, title = {Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method}, author = {Roman Vershynin}, year = {2006}, doi = {10.1109/FOCS.2006.19}, url = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2006.19}, researchr = {https://researchr.org/publication/Vershynin06}, cites = {0}, citedby = {0}, pages = {133-142}, booktitle = {47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings}, publisher = {IEEE Computer Society}, isbn = {0-7695-2720-5}, }