Minimization Of Boolean Functions

Minimization of Boolean Functions is a formal method in combinational logic synthesis that reduces the algebraic complexity of Boolean expressions to their simplest equivalent form while preserving their logical functionality.

659

Publications

28.8K

Citations

1.1K

Authors

482

Institutions

Publications per year

2017–2026

53

Authors

1.1K

  1. RD
    Rolf Drechsler

    University of Bremen, Germany

    26 publications · 898 citations

    19

    h-index

  2. MP
    Marek Perkowski

    Portland State University, United States

    24 publications · 1.1K citations

    19

    h-index

  3. RK
    Robert K. Brayton

    University of California, Berkeley, United States

    17 publications · 777 citations

    15

    h-index

  4. TS
    T. Sasao

    Kyushu Institute of Technology, Japan

    17 publications · 679 citations

    14

    h-index

  5. GD
    Giovanni De Micheli

    École Polytechnique Fédérale de Lausanne, Switzerland

    13 publications · 641 citations

    13

    h-index

1–5 of 1.1K

Venues

  1. IEEE Transactions on Computers

    64 publications · 2.3K citations

    29

    h-index

  2. 27

    h-index

  3. IEEE Transactions on Electronic Computers

    19 publications · 842 citations

    13

    h-index

  4. International Journal of Electronics

    10 publications · 200 citations

    10

    h-index

  5. 10

    h-index

1–5