Nc Complexity Class
The NC Complexity Class is a complexity class consisting of decision problems solvable on a parallel computer in polylogarithmic time using a polynomial number of processors, distinguishing it from other complexity classes by its efficient parallelizability within these resource bounds.
55
Publications
3.2K
Citations
92
Authors
67
Institutions
Publications per year
2017–2026
1
55
Attribute-based encryption for circuits
S. Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee · 2013 · 399 citations
Parallel Quantum Computation and Quantum Codes
Cristopher Moore, Martin Nilsson · SIAM Journal on Computing · 2001 · 176 citations
Computing, Computer Science, Physics +15
The complexity of XPath query evaluation
Georg Gottlob, Christoph Koch, Reinhard Pichler · 2003 · 137 citations · Full text
1–5 of 55
92
University of Massachusetts Amherst, United States
5 publications · 630 citations
5
h-index
4
h-index
3
h-index
2
h-index
2
h-index
1–5 of 92
67
Hebrew University of Jerusalem
Jerusalem, Israel
4 h-index
4 publications
225 citations

University of Toronto
Toronto, Canada
4 h-index
7 publications
906 citations

University of Massachusetts Amherst
Amherst Center, United States
4 h-index
5 publications
664 citations
Stanford University
Stanford, United States
3 h-index
5 publications
372 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
3 publications
108 citations

McGill University
Montreal, Canada
3 h-index
3 publications
249 citations
Boston College
Boston, United States
2 h-index
2 publications
58 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
4 publications
102 citations
1–8 of 67
7 publications · 363 citations
7
h-index
JACM · 5 publications · 390 citations
5
h-index
2 publications · 175 citations
2
h-index
2 publications · 439 citations
2
h-index
TOCT · 1 publications · 11 citations
1
h-index
1–5