Deterministic Time Complexity is a computational complexity measure that belongs to the class of time complexity analyses, specifically characterizing the maximum amount of time required by a deterministic Turing machine to solve a decision problem on any input of a given size.
54
Publications
2.7K
Citations
107
Authors
57
Institutions
Publications per year
2017–2026
10
Parents
Publications
54
Triangulating a simple polygon in linear time
Bernard Chazelle · Discrete & Computational Geometry · 1991 · 636 citations · Full text
The Hardest Context-Free Language
Sheila A. Greibach · SIAM Journal on Computing · 1973 · 184 citations
1–5 of 54
Authors
107
- BC
3
h-index
- TM
2
h-index
- GL
2
h-index
- SP
2
h-index
- JS
2
h-index
1–5 of 107
Institutions
57
Princeton University
Princeton, United States
4 h-index
4 publications
907 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
5 publications
168 citations
University of Waterloo
Waterloo, Canada
3 h-index
4 publications
159 citations
University of California, Irvine
Irvine, United States
3 h-index
5 publications
106 citations
University of Copenhagen
Copenhagen, Denmark
2 h-index
2 publications
133 citations
University of Michigan
Ann Arbor, United States
2 h-index
3 publications
76 citations
Stanford University
Stanford, United States
2 h-index
2 publications
89 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
52 citations
1–8 of 57
Venues
- SIAM Journal on Computing
6 publications · 252 citations
6
h-index
- Discrete & Computational Geometry
2 publications · 648 citations
2
h-index
- Journal of Symbolic Logic
2 publications · 57 citations
2
h-index
- International Journal of Algebra and Computation
IJAC · 1 publications · 32 citations
1
h-index
- DSpace@MIT (Massachusetts Institute of Technology)
Repository · 1 publications · 53 citations
1
h-index
1–5