Turing Machine Complexity is a theoretical framework in computational complexity theory that characterizes the inherent resource requirements, such as time or space, of a Turing machine as a function of input size, distinguishing it from other complexity measures by its foundational reliance on the abstract machine model of computation.
186
Publications
19.3K
Citations
259
Authors
180
Institutions
Publications per year
2017–2026
9
Parents
Publications
186
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
STRING-MATCHING AND OTHER PRODUCTS
Manuela Fischer, Mike Paterson · DSpace@MIT (Massachusetts Institute of Technology) · 1974 · 398 citations · Full text
1–5 of 186
Authors
259
- RE
5
h-index
- HZ
5
h-index
- JF
4
h-index
- JV
4
h-index
- JE
4
h-index
1–5 of 259
Institutions
180
Cornell University
Ithaca, United States
12 h-index
15 publications
1K citations
University of Toronto
Toronto, Canada
6 h-index
6 publications
6.6K citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
7 publications
202 citations
Centre National de la Recherche Scientifique
Paris, France
5 h-index
7 publications
162 citations
Pennsylvania State University
State College, United States
4 h-index
4 publications
80 citations
IBM (United States)
Armonk, United States
4 h-index
5 publications
304 citations
Swansea University
Swansea, United Kingdom
4 h-index
8 publications
212 citations
University of Minnesota
Minneapolis, United States
4 h-index
6 publications
171 citations
1–8 of 180
Venues
- SIAM Journal on Computing
15 publications · 1.3K citations
14
h-index
- Journal of the ACM
JACM · 11 publications · 933 citations
11
h-index
- Theoretical Computer Science
12 publications · 699 citations
11
h-index
- Journal of Computer and System Sciences
6 publications · 881 citations
6
h-index
- Mathematical logic quarterly
MLQ · 5 publications · 138 citations
5
h-index
1–5