Non-deterministic Time Complexity
Non-Deterministic Time Complexity is the computational complexity measure that characterizes the maximum number of steps a non-deterministic Turing machine requires to solve a decision problem over all possible computation paths for a given input size.
19
Publications
641
Citations
42
Authors
31
Institutions
Publications per year
2017–2026
2
Parents
19
A hierarchy for nondeterministic time complexity
Stephen Cook · 1972 · 56 citations · Full text
R.J. Lipton, Anastasios Viglas · 2003 · 55 citations
1–5 of 19
42
2
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 42
31
Princeton University
Princeton, United States
3 h-index
4 publications
165 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
220 citations

Pennsylvania State University
State College, United States
1 h-index
2 publications
72 citations

Shanghai Ocean University
Shanghai, China
1 h-index
2 publications
36 citations

University of the Free State
Bloemfontein, South Africa
1 h-index
1 publications
23 citations

Universitat Pompeu Fabra
Barcelona, Spain
1 h-index
1 publications
15 citations

Nationwide Children's Hospital
Columbus, United States
1 h-index
2 publications
34 citations
Battelle
Columbus, United States
1 h-index
2 publications
34 citations
1–8 of 31
2 publications · 190 citations
2
h-index
Repository · 1 publications · 19 citations
1
h-index
1 publications · 17 citations
1
h-index
Repository · 1 publications · 22 citations
1
h-index
1 publications · 13 citations
1
h-index
1–5