Boolean Function Decomposition

Boolean Function Decomposition is a computational method in digital logic design that decomposes a complex Boolean function into simpler, interdependent subfunctions to optimize circuit implementation and analysis.

424

Publications

16.1K

Citations

695

Authors

321

Institutions

Publications per year

2017–2026

31

Authors

695

  1. RD
    Rolf Drechsler

    University of Bremen, Germany

    12 publications · 348 citations

    11

    h-index

  2. MP
    Marek Perkowski

    Portland State University, United States

    13 publications · 602 citations

    11

    h-index

  3. LJ
    L. Jóźwiak

    Eindhoven University of Technology, Netherlands

    10 publications · 344 citations

    10

    h-index

  4. TS
    T. Sasao

    Kyushu Institute of Technology, Japan

    9 publications · 400 citations

    9

    h-index

  5. AM
    Alan Mishchenko

    University of California, Berkeley, United States

    9 publications · 482 citations

    9

    h-index

1–5 of 695

Venues

  1. 19

    h-index

  2. IEEE Transactions on Computers

    25 publications · 999 citations

    18

    h-index

  3. Discrete Applied Mathematics

    10 publications · 255 citations

    10

    h-index

  4. IEEE Transactions on Electronic Computers

    7 publications · 100 citations

    7

    h-index

  5. 5

    h-index

1–5