Space-smallness
Space-Smallness is a theoretical construct in computational complexity theory that characterizes the minimal asymptotic space required by a deterministic Turing machine to solve a decision problem, distinguished by its focus on sublinear space bounds inherently smaller than the input size.
8
Publications
297
Citations
15
Authors
10
Institutions
Publications per year
2017–2026
0
Parents
8
Membership in Constant Time and Almost-Minimum Space
Andrej Brodnik, J. Ian Munro · SIAM Journal on Computing · 1999 · 143 citations
Small H spaces related to Moore spaces
David J. Anick, Brayton Gray · Topology · 1995 · 24 citations
The recognition of deterministic CFLs in small time and space
Burchard von Braunmühl, Stephen Cook, Kurt Mehlhorn et al. · Information and Control · 1983 · 23 citations · Full text
1–5 of 8
15
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 15
10
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
4 publications
92 citations
Northwestern University
Evanston, United States
1 h-index
2 publications
48 citations
University of Bonn
Bonn, Germany
1 h-index
2 publications
46 citations
Max Planck Society
Munich, Germany
1 h-index
1 publications
23 citations

University of Toronto
Toronto, Canada
1 h-index
1 publications
23 citations
University of Washington
Seattle, United States
1 h-index
1 publications
10 citations

Aarhus University
Aarhus, Denmark
1 h-index
1 publications
12 citations
University of Illinois Chicago
Chicago, United States
1 h-index
2 publications
48 citations
1–8 of 10
2 publications · 166 citations
2
h-index
1 publications · 24 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 39 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5