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
659
Minimization of Boolean Functions*
E.J. McCluskey · Bell System Technical Journal · 1956 · 1.2K citations
The Problem of Simplifying Truth Functions
W. V. Quine · American Mathematical Monthly · 1952 · 801 citations
1–5 of 659
1.1K
19
h-index
19
h-index
15
h-index
14
h-index
École Polytechnique Fédérale de Lausanne, Switzerland
13 publications · 641 citations
13
h-index
1–5 of 1.1K
482
University of California, Berkeley
Berkeley, United States
24 h-index
68 publications
2.8K citations

Portland State University
Portland, United States
20 h-index
57 publications
2.2K citations
Synopsys (United States)
Mountain View, United States
15 h-index
26 publications
2K citations

University of Freiburg
Freiburg im Breisgau, Germany
14 h-index
29 publications
1K citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
14 h-index
34 publications
2K citations
Kyushu Institute of Technology
Kitakyushu, Japan
14 h-index
25 publications
828 citations
University of Southern California
Los Angeles, United States
12 h-index
21 publications
680 citations
Massachusetts Institute of Technology
Cambridge, United States
12 h-index
13 publications
623 citations
1–8 of 482
64 publications · 2.3K citations
29
h-index
44 publications · 2.4K citations
27
h-index
19 publications · 842 citations
13
h-index
10 publications · 200 citations
10
h-index
11 publications · 217 citations
10
h-index
1–5