Lower Bound Techniques
Lower Bound Techniques is a methodological framework in computational complexity theory that establishes the minimum resources required by any algorithm within a given model of computation to solve a problem, distinguishing it from other analytical approaches by focusing on inherent limitations rather than algorithmic efficiency or upper bounds.
1.5K
Publications
76.3K
Citations
2.8K
Authors
959
Institutions
Publications per year
2017–2026
198
1.5K
A Branch and Bound Algorithm for Feature Subset Selection
Narendra, Fukunaga · IEEE Transactions on Computers · 1977 · 1.2K citations
Saul Schleimer, Daniel Shawcross Wilkerson, Alex Aiken · 2003 · 1.1K citations
Michael Ian Shamos, Dan Hoey · 1975 · 1.1K citations
An Algorithm for the Traveling Salesman Problem
John D. C. Little, Katta G. Murty, Dura W. Sweeney et al. · Operations Research · 1963 · 1K citations · Full text
1–5 of 1.5K
2.8K
Rutgers, The State University of New Jersey, United States
8 publications · 388 citations
8
h-index
7
h-index
6
h-index
5
h-index
5
h-index
1–5 of 2.8K
959
Massachusetts Institute of Technology
Cambridge, United States
26 h-index
55 publications
5.6K citations
University of California, Berkeley
Berkeley, United States
25 h-index
72 publications
8.4K citations
Stanford University
Stanford, United States
25 h-index
40 publications
3.1K citations
Princeton University
Princeton, United States
22 h-index
46 publications
3.5K citations

Tel Aviv University
Tel Aviv, Israel
20 h-index
45 publications
1.5K citations
Columbia University
New York, United States
18 h-index
30 publications
1.5K citations
Georgia Institute of Technology
Atlanta, United States
18 h-index
27 publications
2.2K citations
Technion – Israel Institute of Technology
Haifa, Israel
17 h-index
40 publications
1.4K citations
1–8 of 959
31 publications · 3.3K citations
26
h-index
41 publications · 2.7K citations
26
h-index
36 publications · 2.5K citations
25
h-index
JACM · 23 publications · 1.7K citations
20
h-index
Repository · 55 publications · 1.3K citations
20
h-index
1–5