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

Authors

92

  1. DA
    David A. Mix Barrington

    University of Massachusetts Amherst, United States

    5 publications · 630 citations

    5

    h-index

  2. DT
    Denis Thérien

    McGill University, Canada

    4 publications · 282 citations

    4

    h-index

  3. PM
    Pierre McKenzie

    Université de Montréal, Canada

    3 publications · 132 citations

    3

    h-index

  4. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    2 publications · 111 citations

    2

    h-index

  5. JW
    Joe Warren

    Rice University, United States

    2 publications · 42 citations

    2

    h-index

1–5 of 92

Venues

  1. SIAM Journal on Computing

    7 publications · 363 citations

    7

    h-index

  2. Journal of the ACM

    JACM · 5 publications · 390 citations

    5

    h-index

  3. Algorithmica

    2 publications · 175 citations

    2

    h-index

  4. Journal of Computer and System Sciences

    2 publications · 439 citations

    2

    h-index

  5. ACM Transactions on Computation Theory

    TOCT · 1 publications · 11 citations

    1

    h-index

1–5