Boolean Minimization

Boolean Minimization is a formal method in Boolean algebra that reduces complex logical expressions to their simplest equivalent form by eliminating redundant variables and terms while preserving logical equivalence.

390

Publications

15.7K

Citations

746

Authors

388

Institutions

Publications per year

2017–2026

42

Authors

746

  1. RK
    Robert K. Brayton

    University of California, Berkeley, United States

    11 publications · 702 citations

    11

    h-index

  2. MP
    Massoud Pedram

    University of Southern California, United States

    8 publications · 229 citations

    8

    h-index

  3. SD
    Srinivas Devadas

    Massachusetts Institute of Technology, United States

    8 publications · 306 citations

    8

    h-index

  4. VC
    Valentina Ciriani

    University of Pisa, Italy

    8 publications · 147 citations

    8

    h-index

  5. AR
    A. Richard Newton

    University of California, Berkeley, United States

    7 publications · 294 citations

    7

    h-index

1–5 of 746

Venues

  1. 15

    h-index

  2. IEEE Transactions on Computers

    20 publications · 593 citations

    14

    h-index

  3. Discrete Applied Mathematics

    12 publications · 271 citations

    10

    h-index

  4. IEEE Transactions on Electronic Computers

    9 publications · 360 citations

    9

    h-index

  5. International Journal of Electronics

    6 publications · 165 citations

    6

    h-index

1–5