Computational Lower Bounds
Computational Lower Bounds is a theoretical construct in computational complexity that establishes the minimum amount of resources, such as time or space, required by any algorithm to solve a given computational problem, thereby delimiting the inherent difficulty of the problem regardless of the specific algorithmic approach employed.
636
Publications
32.2K
Citations
1.1K
Authors
475
Institutions
Publications per year
2017–2026
127
Parents
636
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve et al. · Journal of the ACM · 2001 · 659 citations
Capacitated arc routing problems
Bruce Golden, Richard T. Wong · Networks · 1981 · 568 citations
Real-time monocular SLAM: Why filter?
Hauke Strasdat, J. M. M. Montiel, Andrew J. Davison · 2010 · 460 citations
1–5 of 636
1.1K
11
h-index
10
h-index
8
h-index
8
h-index
6
h-index
1–5 of 1.1K
475
Stanford University
Stanford, United States
20 h-index
46 publications
2K citations
Massachusetts Institute of Technology
Cambridge, United States
18 h-index
44 publications
1.4K citations
University of California, Berkeley
Berkeley, United States
17 h-index
35 publications
2.9K citations
Princeton University
Princeton, United States
17 h-index
26 publications
1.5K citations
IBM (United States)
Armonk, United States
13 h-index
15 publications
778 citations
University of Washington
Seattle, United States
11 h-index
22 publications
945 citations
IBM Research - Almaden
San Jose, United States
11 h-index
13 publications
1.2K citations
University of California San Diego
San Diego, United States
11 h-index
18 publications
1.2K citations
1–8 of 475
Repository · 53 publications · 1.7K citations
22
h-index
27 publications · 1.9K citations
21
h-index
23 publications · 2K citations
19
h-index
Repository · 16 publications · 356 citations
12
h-index
JACM · 12 publications · 1.5K citations
11
h-index
1–5