Nonuniform Complexity

Nonuniform Complexity is a computational complexity model that allows different algorithms or circuits to be used for inputs of different sizes, distinguishing it from uniform models by permitting resource usage to vary across input lengths without a single, finite description governing all instances.

25

Publications

3.2K

Citations

37

Authors

25

Institutions

Publications per year

2017–2026

1

Authors

37

  1. JH
    Jack H. Lutz

    Iowa State University, United States

    4 publications · 415 citations

    4

    h-index

  2. EA
    Eric Allender

    Rutgers, The State University of New Jersey, United States

    4 publications · 243 citations

    4

    h-index

  3. CM
    C.A. Middelburg

    University of Amsterdam, Netherlands

    2 publications · 30 citations

    2

    h-index

  4. RG
    Ricard Gavaldà

    Universitat Politècnica de Catalunya, Spain

    2 publications · 109 citations

    2

    h-index

  5. TT
    Thomas Thierauf

    Universität Ulm, Germany

    2 publications · 41 citations

    2

    h-index

1–5 of 37

Venues

  1. SIAM Journal on Computing

    4 publications · 326 citations

    4

    h-index

  2. Theoretical Computer Science

    3 publications · 78 citations

    3

    h-index

  3. Journal of Computer and System Sciences

    2 publications · 289 citations

    2

    h-index

  4. Annals of Pure and Applied Logic

    2 publications · 69 citations

    2

    h-index

  5. Choice Reviews Online

    CRO · 2 publications · 1.5K citations

    2

    h-index

1–5