Turing Machine Space Bounds
Turing Machine Space Bounds is a theoretical construct in computational complexity theory that specifies the maximum amount of tape space a Turing machine requires to decide a language as a function of the input size, distinguishing it from time-based or circuit-based complexity measures.
40
Publications
2K
Citations
55
Authors
40
Institutions
Publications per year
2017–2026
0
Parents
40
On Relating Time and Space to Size and Depth
Allan Borodin · SIAM Journal on Computing · 1977 · 341 citations
John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant · Journal of the ACM · 1977 · 255 citations · Full text
The Complexity of Parallel Computations
James Wyllie · eCommons (Cornell University) · 1979 · 201 citations · Full text
1–5 of 40
55
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 55
40

University of Toronto
Toronto, Canada
3 h-index
3 publications
483 citations
Bielefeld University
Bielefeld, Germany
3 h-index
3 publications
289 citations
University of Washington
Seattle, United States
2 h-index
2 publications
93 citations

Yamaguchi University
Yamaguchi, Japan
2 h-index
3 publications
74 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
3 publications
35 citations

Cornell University
Ithaca, United States
2 h-index
3 publications
303 citations

University of Milano-Bicocca
Milan, Italy
2 h-index
9 publications
165 citations

University of Minnesota
Minneapolis, United States
2 h-index
5 publications
137 citations
1–8 of 40
9 publications · 644 citations
9
h-index
MLQ · 2 publications · 75 citations
2
h-index
2 publications · 44 citations
2
h-index
JACM · 2 publications · 308 citations
2
h-index
2 publications · 49 citations
2
h-index
1–5