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
Parents
424
A computational logic handbook
Mathematics and Computers in Simulation · 1989 · 582 citations
A Method of Majority Logic Reduction for Quantum Cellular Automata
Rui Zhang, Konrad Walus, W. Wang et al. · IEEE Transactions on Nanotechnology · 2004 · 392 citations
Spectral techniques in digital logic
S.L. Hurst, D. Michael Miller, J.C. Muzio · Signal Processing · 1985 · 368 citations
1–5 of 424
695
11
h-index
11
h-index
10
h-index
9
h-index
9
h-index
1–5 of 695
321
University of California, Berkeley
Berkeley, United States
14 h-index
30 publications
982 citations
Kyushu Institute of Technology
Kitakyushu, Japan
12 h-index
18 publications
637 citations
University of Bremen
Bremen, Germany
10 h-index
15 publications
704 citations

Portland State University
Portland, United States
10 h-index
21 publications
792 citations

Silesian University of Technology
Gliwice, Poland
9 h-index
16 publications
400 citations
University of Southern California
Los Angeles, United States
9 h-index
18 publications
1.2K citations
Politecnico di Torino
Turin, Italy
9 h-index
20 publications
490 citations

University of Pisa
Pisa, Italy
8 h-index
10 publications
287 citations
1–8 of 321
28 publications · 1.4K citations
19
h-index
25 publications · 999 citations
18
h-index
10 publications · 255 citations
10
h-index
7 publications · 100 citations
7
h-index
5 publications · 74 citations
5
h-index
1–5