Monotone Boolean Functions

Monotone Boolean Functions is a class of Boolean functions in which the output does not decrease when any input variable changes from 0 to 1, distinguishing it from general Boolean functions by preserving the partial order of inputs under component-wise comparison.

168

Publications

6.2K

Citations

253

Authors

172

Institutions

Publications per year

2017–2026

20

Variants

Monotone Boolean Function

Authors

253

  1. RA
    Rocco A. Servedio

    Columbia University, United States

    7 publications · 276 citations

    7

    h-index

  2. RR
    Ronitt Rubinfeld

    Massachusetts Institute of Technology, United States

    4 publications · 256 citations

    4

    h-index

  3. NP
    Nicholas Pippenger

    University of British Columbia, Canada

    4 publications · 98 citations

    4

    h-index

  4. IW
    Ingo Wegener

    TU Dortmund University, Germany

    4 publications · 131 citations

    4

    h-index

  5. AS
    Alex Samorodnitsky

    Hebrew University of Jerusalem, Israel

    4 publications · 349 citations

    4

    h-index

1–5 of 253

Venues

  1. arXiv (Cornell University)

    Repository · 8 publications · 176 citations

    8

    h-index

  2. IEEE Transactions on Computers

    7 publications · 178 citations

    7

    h-index

  3. Information Processing Letters

    7 publications · 169 citations

    7

    h-index

  4. SIAM Journal on Computing

    7 publications · 338 citations

    7

    h-index

  5. Discrete Applied Mathematics

    5 publications · 211 citations

    5

    h-index

1–5