Resource-bounded Complexity

Resource-Bounded Complexity is a computational complexity measure that belongs to the class of theoretical computer science constructs, specifically defined by the restriction of computational resources such as time or space, differentiating it from unbounded models by quantifying the efficiency of algorithms under explicit resource constraints.

69

Publications

3K

Citations

139

Authors

97

Institutions

Publications per year

2017–2026

9

Authors

139

  1. JH
    Jack H. Lutz

    Iowa State University, United States

    6 publications · 352 citations

    6

    h-index

  2. SF
    Stephen Fenner

    University of Chicago, United States

    2 publications · 34 citations

    2

    h-index

  3. SM
    Steven M. Kautz

    Children's Hospital of Los Angeles, United States

    2 publications · 26 citations

    2

    h-index

  4. KO
    Kevin O’Neill

    Vanderbilt University Medical Center, United States

    2 publications · 154 citations

    2

    h-index

  5. PB
    Peter Bro Miltersen

    Aarhus University, Denmark

    2 publications · 26 citations

    2

    h-index

1–5 of 139

Venues

  1. SIAM Journal on Computing

    7 publications · 400 citations

    7

    h-index

  2. Theoretical Computer Science

    4 publications · 115 citations

    4

    h-index

  3. IEEE Transactions on Information Theory

    3 publications · 194 citations

    3

    h-index

  4. ArXiv.org

    Repository · 2 publications · 45 citations

    2

    h-index

  5. Journal of Computer and System Sciences

    2 publications · 38 citations

    2

    h-index

1–5