%0 Journal Article %1 journals/jacm/SpielmanT04 %A Spielman, Daniel A. %A Teng, Shang-Hua %D 2004 %J J. ACM %K dblp %N 3 %P 385-463 %T Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. %U http://dblp.uni-trier.de/db/journals/jacm/jacm51.html#SpielmanT04 %V 51

@article{journals/jacm/SpielmanT04, added-at = {2020-10-26T00:00:00.000+0100}, author = {Spielman, Daniel A. and Teng, Shang-Hua}, biburl = {https://www.bibsonomy.org/bibtex/2d48840f4186ff9d78c8b0fe6dafa12fa/dblp}, ee = {https://www.wikidata.org/entity/Q55952478}, interhash = {36b84bfc8a59f2cdd507e62d947ca6e4}, intrahash = {d48840f4186ff9d78c8b0fe6dafa12fa}, journal = {J. ACM}, keywords = {dblp}, number = 3, pages = {385-463}, timestamp = {2020-10-27T12:24:56.000+0100}, title = {Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time.}, url = {http://dblp.uni-trier.de/db/journals/jacm/jacm51.html#SpielmanT04}, volume = 51, year = 2004 }