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

Authors

43.1K

  1. PB
    Paul Beame

    University of Washington, United States

    39 publications · 2.5K citations

    26

    h-index

  2. RI
    Russell Impagliazzo

    University of California San Diego, United States

    30 publications · 3.7K citations

    24

    h-index

  3. TP
    Toniann Pitassi

    University of Toronto, Canada

    37 publications · 2.3K citations

    24

    h-index

  4. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    33 publications · 2.5K citations

    23

    h-index

  5. MJ
    Martin J. Wainwright

    University of California, Berkeley, United States

    28 publications · 2.9K citations

    21

    h-index

1–5 of 43.1K

Venues

  1. IEEE Transactions on Information Theory

    593 publications · 62.6K citations

    103

    h-index

  2. SIAM Journal on Computing

    234 publications · 14.4K citations

    65

    h-index

  3. Operations Research

    122 publications · 15K citations

    64

    h-index

  4. arXiv (Cornell University)

    Repository · 581 publications · 18.3K citations

    60

    h-index

  5. Journal of the ACM

    JACM · 135 publications · 12.7K citations

    60

    h-index

1–5