Theoremresearch
Smoothed analysis of the simplex method
Also called Spielman–Teng smoothed analysis.
With random perturbation of the input, the simplex method runs in polynomial expected time.
With random perturbation of the input, the simplex method runs in polynomial expected time.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag HKVV09 Edit this page History Report an error