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
Parents
69
A Catalog of Complexity Classes.
David S. Johnson · 1990 · 270 citations
On simultaneous resource bounds
Nicholas Pippenger · 1979 · 251 citations
Dimension in Complexity Classes
Jack H. Lutz · SIAM Journal on Computing · 2003 · 140 citations
The Changing Paradigm of Data-Intensive Computing
R. T. Kouzes, Gordon Anderson, Stephen T. Elbert et al. · Computer · 2009 · 128 citations
1–5 of 69
139
6
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 139
97

Cornell University
Ithaca, United States
4 h-index
8 publications
381 citations

University of Toronto
Toronto, Canada
4 h-index
6 publications
145 citations
University of Chicago
Chicago, United States
4 h-index
4 publications
122 citations
Iowa State University
Ames, United States
3 h-index
3 publications
81 citations
Harvard University
Cambridge, United States
2 h-index
2 publications
79 citations

University of Massachusetts Amherst
Amherst Center, United States
2 h-index
4 publications
230 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
2 h-index
6 publications
168 citations

University of Nottingham
Nottingham, United Kingdom
2 h-index
4 publications
84 citations
1–8 of 97
7 publications · 400 citations
7
h-index
4 publications · 115 citations
4
h-index
3 publications · 194 citations
3
h-index
Repository · 2 publications · 45 citations
2
h-index
2 publications · 38 citations
2
h-index
1–5