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

Authors

2.8K

  1. MS
    Michael Saks

    Rutgers, The State University of New Jersey, United States

    8 publications · 388 citations

    8

    h-index

  2. ZG
    Zvi Galil

    Tel Aviv University, Israel

    7 publications · 149 citations

    7

    h-index

  3. NA
    Noga Alon

    Tel Aviv University, Israel

    6 publications · 238 citations

    6

    h-index

  4. CC
    Chengbin Chu

    Université de Technologie de Troyes, France

    5 publications · 262 citations

    5

    h-index

  5. RD
    Ronald de Wolf

    Centrum Wiskunde & Informatica, Netherlands

    5 publications · 204 citations

    5

    h-index

1–5 of 2.8K

Venues

  1. Operations Research

    31 publications · 3.3K citations

    26

    h-index

  2. IEEE Transactions on Information Theory

    41 publications · 2.7K citations

    26

    h-index

  3. SIAM Journal on Computing

    36 publications · 2.5K citations

    25

    h-index

  4. Journal of the ACM

    JACM · 23 publications · 1.7K citations

    20

    h-index

  5. arXiv (Cornell University)

    Repository · 55 publications · 1.3K citations

    20

    h-index

1–5