Circuit Size Complexity

Circuit Size Complexity is the minimum number of gates required in a Boolean circuit to compute a given Boolean function, serving as a measure of computational resource bounds within circuit complexity theory.

279

Publications

13.7K

Citations

503

Authors

243

Institutions

Publications per year

2017–2026

32

Authors

503

  1. DB
    David Blaauw

    University of Michigan, United States

    7 publications · 414 citations

    7

    h-index

  2. SV
    Sarma Vrudhula

    Arizona State University, United States

    6 publications · 246 citations

    6

    h-index

  3. AR
    Alexander Razborov

    Steklov Mathematical Institute, Russia

    6 publications · 889 citations

    6

    h-index

  4. VZ
    Vladimir Zolotov

    Motorola (United States), United States

    6 publications · 283 citations

    6

    h-index

  5. PP
    Pavel Pudlák

    Czech Academy of Sciences, Institute of Mathematics, Czechia

    5 publications · 232 citations

    5

    h-index

1–5 of 503

Venues

  1. IEEE Transactions on Computers

    17 publications · 1.4K citations

    16

    h-index

  2. SIAM Journal on Computing

    16 publications · 1.2K citations

    14

    h-index

  3. 13

    h-index

  4. Theoretical Computer Science

    11 publications · 424 citations

    11

    h-index

  5. Information Processing Letters

    7 publications · 179 citations

    7

    h-index

1–5