Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
algorithms
|
| gptkbp:combines |
average-case analysis
worst-case analysis |
| gptkbp:describes |
expected performance under slight random perturbations
|
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:introduced |
gptkb:Daniel_Spielman
gptkb:Shang-Hua_Teng |
| gptkbp:introducedIn |
2001
|
| gptkbp:notableFor |
gptkb:simplex_algorithm
|
| gptkbp:notablePublication |
gptkb:Smoothed_Analysis_of_Algorithms:_Why_The_Simplex_Algorithm_Usually_Takes_Polynomial_Time
|
| gptkbp:purpose |
to explain practical performance of algorithms
|
| gptkbp:relatedTo |
algorithm analysis
probabilistic analysis |
| gptkbp:bfsParent |
gptkb:Shang-Hua_Teng
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
smoothed analysis
|