Lower Bounds
Lower Bounds is a theoretical construct in computational complexity that establishes the minimum asymptotic time complexity required by any algorithm to solve a given problem within a specified model of computation.
13.1K
Publications
726.5K
Citations
43.1K
Authors
3.6K
Institutions
Publications per year
2017–2026
2.2K
13.1K
Lloyd M. Robeson · Journal of Membrane Science · 2008 · 5.8K citations
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text
1–5 of 13.1K
43.1K
26
h-index
University of California San Diego, United States
30 publications · 3.7K citations
24
h-index
24
h-index
23
h-index
University of California, Berkeley, United States
28 publications · 2.9K citations
21
h-index
1–5 of 43.1K
3.6K
Massachusetts Institute of Technology
Cambridge, United States
84 h-index
1.1K publications
123.3K citations
University of California, Berkeley
Berkeley, United States
80 h-index
866 publications
66K citations
Stanford University
Stanford, United States
76 h-index
478 publications
44.8K citations
Princeton University
Princeton, United States
72 h-index
656 publications
45.4K citations
University of California San Diego
San Diego, United States
59 h-index
581 publications
44.3K citations
Carnegie Mellon University
Pittsburgh, United States
59 h-index
503 publications
30.7K citations

Centre National de la Recherche Scientifique
Paris, France
57 h-index
2.3K publications
114.8K citations

Cornell University
Ithaca, United States
56 h-index
435 publications
32.4K citations
1–8 of 3.6K
593 publications · 62.6K citations
103
h-index
234 publications · 14.4K citations
65
h-index
122 publications · 15K citations
64
h-index
Repository · 581 publications · 18.3K citations
60
h-index
JACM · 135 publications · 12.7K citations
60
h-index
1–5