Worst-case Complexity
Worst-Case Complexity is the asymptotic upper bound on the computational resource usage of an algorithm, defined as the maximum number of steps required over all possible inputs of a given size, distinguishing it from average-case or best-case analyses by focusing on the most unfavorable input scenario.
1.2K
Publications
72.4K
Citations
2.2K
Authors
736
Institutions
Publications per year
2017–2026
163
Parents
1.2K
Lieven Vandenberghe, Stephen Boyd · SIAM Review · 1996 · 4.1K citations
Efficient Fully Homomorphic Encryption from (Standard) LWE
Zvika Brakerski, Vinod Vaikuntanathan · 2011 · 1.5K citations
1–5 of 1.2K
2.2K
10
h-index
7
h-index
7
h-index
7
h-index
6
h-index
1–5 of 2.2K
736
University of California, Berkeley
Berkeley, United States
27 h-index
45 publications
3.9K citations
Massachusetts Institute of Technology
Cambridge, United States
25 h-index
53 publications
3.2K citations
Stanford University
Stanford, United States
19 h-index
37 publications
3.5K citations
Carnegie Mellon University
Pittsburgh, United States
17 h-index
26 publications
2K citations
Columbia University
New York, United States
17 h-index
23 publications
1.8K citations
University of California San Diego
San Diego, United States
15 h-index
32 publications
3.1K citations
Microsoft (United States)
Redmond, United States
15 h-index
19 publications
1.2K citations

University of Minnesota
Minneapolis, United States
15 h-index
21 publications
1.6K citations
1–8 of 736
58 publications · 6.9K citations
38
h-index
Repository · 40 publications · 1.1K citations
20
h-index
22 publications · 1K citations
19
h-index
JACM · 19 publications · 3.4K citations
18
h-index
16 publications · 985 citations
13
h-index
1–5