Smoothed Complexity
Smoothed Complexity is a computational complexity measure that belongs to the class of hybrid analysis frameworks, differing from worst-case and average-case analyses by evaluating the expected performance of algorithms under slight random perturbations of worst-case inputs.
20
Publications
1.2K
Citations
39
Authors
25
Institutions
Publications per year
2017–2026
1
Parents
20
Settling the complexity of computing two-player Nash equilibria
Xi Chen, Xiaotie Deng, Shang‐Hua Teng · Journal of the ACM · 2009 · 579 citations
k-Means Has Polynomial Smoothed Complexity
David Arthur, Bodo Manthey, Heiko Röglin · 2009 · 104 citations · Full text
On a problem posed by Steve Smale
Peter Bürgisser, Felipe Cucker · Annals of Mathematics · 2011 · 77 citations · Full text
1–5 of 20
39
6
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 39
25
Boston University
Boston, United States
4 h-index
4 publications
666 citations
Microsoft (United States)
Redmond, United States
4 h-index
5 publications
122 citations
Stanford University
Stanford, United States
4 h-index
5 publications
172 citations
Maastricht University
Maastricht, The Netherlands
3 h-index
3 publications
155 citations
Tsinghua University
Beijing, China
3 h-index
3 publications
604 citations

City University of Hong Kong
Hong Kong, Hong Kong
3 h-index
3 publications
668 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
3 publications
146 citations
Akamai (United States)
Cambridge, United States
3 h-index
3 publications
646 citations
1–8 of 25
Repository · 2 publications · 85 citations
2
h-index
1 publications · 27 citations
1
h-index
1 publications · 58 citations
1
h-index
1 publications · 20 citations
1
h-index
TALG · 1 publications · 13 citations
1
h-index
1–5