Non-deterministic Polynomial Time
Non-Deterministic Polynomial Time is a computational complexity class that consists of decision problems for which a given solution can be verified by a deterministic Turing machine in polynomial time, distinguishing it from deterministic classes by allowing non-deterministic branching during computation.
148
Publications
6.6K
Citations
409
Authors
239
Institutions
Publications per year
2017–2026
64
148
Non-interactive cryptocomputing for NC/sup 1/
Tomas Sander, Adam Young, Moti Yung · 2003 · 279 citations
A Novel K-Means Clustering Algorithm with a Noise Algorithm for Capturing Urban Hotspots
Xiaojuan Ran, Xiangbing Zhou, Lei Mu et al. · Applied Sciences · 2021 · 233 citations · Full text
1–5 of 148
409
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 409
239
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
6 publications
339 citations
Princeton University
Princeton, United States
4 h-index
7 publications
241 citations
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
74 citations

Pennsylvania State University
State College, United States
3 h-index
4 publications
201 citations

Huazhong University of Science and Technology
Wuhan, China
3 h-index
8 publications
381 citations
Solamalai College of Engineering
Madurai, India
3 h-index
3 publications
96 citations

Shanghai Jiao Tong University
Shanghai, China
3 h-index
8 publications
287 citations

Chinese Academy of Sciences
Beijing, China
3 h-index
10 publications
236 citations
1–8 of 239
6 publications · 201 citations
6
h-index
6 publications · 190 citations
6
h-index
Repository · 4 publications · 57 citations
4
h-index
3 publications · 92 citations
3
h-index
3 publications · 764 citations
3
h-index
1–5