Uniform Circuit Complexity

Uniform Circuit Complexity is a complexity-theoretic framework that characterizes the computational power of families of Boolean circuits wherein each circuit in the sequence is efficiently generated by a deterministic algorithm, thus imposing a uniformity condition that links circuit-based computation to uniform models such as Turing machines.

23

Publications

2.2K

Citations

36

Authors

25

Institutions

Publications per year

2017–2026

1

Authors

36

  1. DA
    David A. Mix Barrington

    University of Massachusetts Amherst, United States

    4 publications · 256 citations

    4

    h-index

  2. EA
    Eric Allender

    Rutgers, The State University of New Jersey, United States

    3 publications · 295 citations

    3

    h-index

  3. WL
    Walter L. Ruzzo

    University of Washington, United States

    2 publications · 459 citations

    2

    h-index

  4. NI
    Neil Immerman

    University of Massachusetts Amherst, United States

    2 publications · 141 citations

    2

    h-index

  5. AC
    Andrew Chiu

    University of Wisconsin–Milwaukee, United States

    1 publications · 89 citations

    1

    h-index

1–5 of 36

Venues

  1. SIAM Journal on Computing

    4 publications · 278 citations

    4

    h-index

  2. Theoretical Computer Science

    2 publications · 74 citations

    2

    h-index

  3. Journal of Computer and System Sciences

    2 publications · 621 citations

    2

    h-index

  4. Journal of the ACM

    JACM · 1 publications · 53 citations

    1

    h-index

  5. RAIRO - Theoretical Informatics and Applications

    ITA · 1 publications · 89 citations

    1

    h-index

1–5