"Smoothed analysis of algorithms: Why the simplex algorithm usually takes ..."

Daniel A. Spielman, Shang-Hua Teng (2004)

> Home

Details and statistics

DOI: 10.1145/990308.990310

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/SpielmanT04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/SpielmanT04
Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3): 385-463 (2004)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.