Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Daniel A. Spielman Massachusetts Institute of Technology, Boston, Massachusetts
Shang-Hua Teng Boston University, Boston, Massachusetts, and Akamai Technologies, Inc., MA
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 51 Issue 3, May 2004
Pages 385-463
ACM New York, NY, USA
table of contents doi>10.1145/990308.990310
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 14
· Downloads (12 Months): 203
· Downloads (cumulative): 2,876
· Citation Count: 93


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder