Space Complexity Classes is a classification of computational problems based on the amount of memory space required by a Turing machine to solve them, distinguished from other complexity classes by its focus on space resource constraints rather than time or other resources.
27
Publications
616
Citations
49
Authors
30
Institutions
Publications per year
2017–2026
0
Publications
27
1–5 of 27
Authors
49
- AL
2
h-index
- CZ
2
h-index
- GM
2
h-index
- AE
2
h-index
- JS
2
h-index
1–5 of 49
Institutions
30
Cornell University
Ithaca, United States
2 h-index
4 publications
149 citations
University of Milano-Bicocca
Milan, Italy
2 h-index
8 publications
212 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
2 h-index
2 publications
29 citations
University of Wisconsin–Madison
Madison, United States
2 h-index
2 publications
31 citations
Pennsylvania State University
State College, United States
2 h-index
2 publications
93 citations
University of Milan
Milan, Italy
2 h-index
5 publications
128 citations
University of Waterloo
Waterloo, Canada
1 h-index
2 publications
22 citations
University of Rochester
Rochester, United States
1 h-index
1 publications
10 citations
1–8 of 30
Venues
- Theoretical Computer Science
3 publications · 104 citations
3
h-index
- Journal of Computer and System Sciences
3 publications · 127 citations
3
h-index
- International Journal of Computers Communications & Control
1 publications · 28 citations
1
h-index
- Conference on Learning Theory
Conference · 1 publications · 12 citations
1
h-index
- ACM Transactions on Computational Logic
TOCL · 1 publications · 13 citations
1
h-index
1–5