Nonuniform Complexity Classes

Nonuniform Complexity Classes is a complexity-theoretic category comprising computational problems solvable by families of Boolean circuits whose structure may vary arbitrarily with input length, distinguished from uniform classes by the absence of a required computational constraint linking circuit descriptions across different input sizes.

65

Publications

5.6K

Citations

76

Authors

58

Institutions

Publications per year

2017–2026

2

Authors

76

  1. JH
    Jack H. Lutz

    Iowa State University, United States

    5 publications · 430 citations

    5

    h-index

  2. EA
    Eric Allender

    Rutgers, The State University of New Jersey, United States

    4 publications · 235 citations

    4

    h-index

  3. US
    Uwe Schöning

    University of Stuttgart, Germany

    4 publications · 252 citations

    4

    h-index

  4. SC
    Stephen Cook

    University of Toronto, Canada

    3 publications · 74 citations

    3

    h-index

  5. RW
    Ryan Williams

    Stanford University, United States

    3 publications · 77 citations

    3

    h-index

1–5 of 76

Venues

  1. SIAM Journal on Computing

    11 publications · 622 citations

    11

    h-index

  2. Theoretical Computer Science

    5 publications · 193 citations

    5

    h-index

  3. Journal of Computer and System Sciences

    3 publications · 411 citations

    3

    h-index

  4. Choice Reviews Online

    CRO · 2 publications · 1.5K citations

    2

    h-index

  5. Journal of the ACM

    JACM · 2 publications · 153 citations

    2

    h-index

1–5