Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

46

STOC
2001
ACM

favoriteEmaildiscussreport

317views Algorithms» more STOC 2001»

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

14 years 4 months ago

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

Download page.mi.fu-berlin.de

Daniel A. Spielman, Shang-Hua Teng

Real-time Traffic

Algorithms | Simplex Algorithm | STOC 2001 |

claim paper

Related Content

» Typical properties of winners and losers in discrete optimization

» The Tradeoffs of Large Scale Learning

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2001
Where	STOC
Authors	Daniel A. Spielman, Shang-Hua Teng

Comments (0)