Boolean Function Minimization is a logic synthesis method that belongs to the class of optimization techniques, specifically distinguished by its focus on reducing the algebraic complexity of a Boolean function to achieve a minimal equivalent representation in terms of literals, terms, or gates.
615
Publications
25.4K
Citations
1K
Authors
466
Institutions
Publications per year
2017–2026
66
Publications
615
Minimization of Boolean Functions*
E.J. McCluskey · Bell System Technical Journal · 1956 · 1.2K citations
Minimization of Boolean complexity in human concept learning
Jacob Feldman · Nature · 2000 · 498 citations
1–5 of 615
Authors
1K
- RD
16
h-index
- MP
14
h-index
- RK
12
h-index
- AM
10
h-index
- TS
9
h-index
1–5 of 1K
Institutions
466
University of California, Berkeley
Berkeley, United States
25 h-index
59 publications
4.8K citations
Portland State University
Portland, United States
16 h-index
36 publications
1.5K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
14 h-index
24 publications
1.3K citations
University of Freiburg
Freiburg im Breisgau, Germany
12 h-index
25 publications
846 citations
Synopsys (United States)
Mountain View, United States
10 h-index
16 publications
614 citations
Massachusetts Institute of Technology
Cambridge, United States
10 h-index
10 publications
610 citations
University of Southern California
Los Angeles, United States
10 h-index
17 publications
553 citations
Kyushu Institute of Technology
Kitakyushu, Japan
9 h-index
13 publications
303 citations
1–8 of 466
Venues
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
38 publications · 2.7K citations
27
h-index
- IEEE Transactions on Computers
46 publications · 1.5K citations
24
h-index
- Discrete Applied Mathematics
18 publications · 575 citations
15
h-index
- IEEE Transactions on Electronic Computers
16 publications · 646 citations
12
h-index
- Theoretical Computer Science
9 publications · 313 citations
9
h-index
1–5