Boolean Function Complexity

Boolean Function Complexity is a theoretical framework in computational complexity theory that characterizes the minimum number of basic logical operations required to compute a given boolean function, thereby distinguishing it by the inherent resource demands of boolean computation tasks.

438

Publications

30.6K

Citations

643

Authors

334

Institutions

Publications per year

2017–2026

42

Authors

643

  1. RA
    Rocco A. Servedio

    Columbia University, United States

    15 publications · 628 citations

    12

    h-index

  2. IW
    Ingo Wegener

    TU Dortmund University, Germany

    10 publications · 988 citations

    10

    h-index

  3. RO
    Ryan O’Donnell

    Carnegie Mellon University, United States

    10 publications · 482 citations

    10

    h-index

  4. AA
    Alexander A. Sherstov

    The University of Texas at Austin, United States

    9 publications · 352 citations

    9

    h-index

  5. RD
    Ronald de Wolf

    Centrum Wiskunde & Informatica, Netherlands

    8 publications · 1.2K citations

    8

    h-index

1–5 of 643

Venues

  1. SIAM Journal on Computing

    38 publications · 2K citations

    26

    h-index

  2. IEEE Transactions on Computers

    18 publications · 10.9K citations

    18

    h-index

  3. Theoretical Computer Science

    15 publications · 786 citations

    14

    h-index

  4. IEEE Transactions on Information Theory

    12 publications · 598 citations

    11

    h-index

  5. arXiv (Cornell University)

    Repository · 10 publications · 175 citations

    10

    h-index

1–5