Nondeterministic Complexity is a computational complexity measure that characterizes the minimal resources required by a nondeterministic Turing machine to solve a decision problem in the worst case.
274
Publications
15.8K
Citations
476
Authors
270
Institutions
Publications per year
2017–2026
26
Parents
Publications
274
The Complexity of Decentralized Control of Markov Decision Processes
Daniel S. Bernstein, Robert Givan, Neil Immerman et al. · Mathematics of Operations Research · 2002 · 1.2K citations
Nondeterministic Space is Closed under Complementation
Neil Immerman · SIAM Journal on Computing · 1988 · 649 citations
Jonathan F. Buss, Judy Goldsmith · SIAM Journal on Computing · 1993 · 309 citations
1–5 of 274
Authors
476
- CM
6
h-index
- HK
6
h-index
- KS
6
h-index
- JS
5
h-index
- SC
5
h-index
1–5 of 476
Institutions
270
University of Washington
Seattle, United States
9 h-index
14 publications
1.7K citations
University of Toronto
Toronto, Canada
8 h-index
13 publications
745 citations
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
11 publications
483 citations
Centre National de la Recherche Scientifique
Paris, France
8 h-index
11 publications
199 citations
Pennsylvania State University
State College, United States
7 h-index
10 publications
516 citations
University of California San Diego
San Diego, United States
7 h-index
12 publications
2.3K citations
University of California, Berkeley
Berkeley, United States
6 h-index
8 publications
279 citations
University of Chicago
Chicago, United States
6 h-index
9 publications
786 citations
1–8 of 270
Venues
- SIAM Journal on Computing
36 publications · 2.5K citations
24
h-index
- Theory of Computing Systems
9 publications · 356 citations
9
h-index
- Theoretical Computer Science
9 publications · 220 citations
9
h-index
- Journal of the ACM
JACM · 9 publications · 671 citations
9
h-index
- Journal of Computer and System Sciences
7 publications · 1.7K citations
7
h-index
1–5