Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

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

> Home

Details and statistics

DOI: 10.1145/380752.380813

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/SpielmanT01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/SpielmanT01
Daniel A. Spielman, Shang-Hua Teng:
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. STOC 2001: 296-305

a service of

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.