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

Authors

1.1K

  1. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    12 publications · 735 citations

    11

    h-index

  2. RW
    Ryan Williams

    Stanford University, United States

    11 publications · 445 citations

    10

    h-index

  3. RS
    Rahul Santhanam

    University of Oxford, United Kingdom

    8 publications · 175 citations

    8

    h-index

  4. PB
    Paul Beame

    University of Washington, United States

    8 publications · 336 citations

    8

    h-index

  5. XH
    Xiuzhen Huang

    Arkansas State University, United States

    6 publications · 613 citations

    6

    h-index

1–5 of 1.1K

Venues

  1. arXiv (Cornell University)

    Repository · 53 publications · 1.7K citations

    22

    h-index

  2. SIAM Journal on Computing

    27 publications · 1.9K citations

    21

    h-index

  3. IEEE Transactions on Information Theory

    23 publications · 2K citations

    19

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 16 publications · 356 citations

    12

    h-index

  5. Journal of the ACM

    JACM · 12 publications · 1.5K citations

    11

    h-index

1–5