Skip to content

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

Daniel A. Spielman, Shang-Hua Teng

VenueA*STOC
Year2001
ProceedingsSTOC

Browse the full STOC paper archive.