Boolean Minimization
Boolean Minimization is a formal method in Boolean algebra that reduces complex logical expressions to their simplest equivalent form by eliminating redundant variables and terms while preserving logical equivalence.
390
Publications
15.7K
Citations
746
Authors
388
Institutions
Publications per year
2017–2026
42
Parents
390
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 390
746
11
h-index
8
h-index
8
h-index
8
h-index
7
h-index
1–5 of 746
388
University of California, Berkeley
Berkeley, United States
19 h-index
41 publications
2.8K citations

Portland State University
Portland, United States
10 h-index
18 publications
822 citations
University of Southern California
Los Angeles, United States
9 h-index
16 publications
607 citations

University of Pisa
Pisa, Italy
8 h-index
20 publications
366 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
8 h-index
10 publications
904 citations
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
8 publications
309 citations
Princeton University
Princeton, United States
7 h-index
8 publications
220 citations
Intel (United States)
Santa Clara, United States
6 h-index
6 publications
192 citations
1–8 of 388
17 publications · 1.3K citations
15
h-index
20 publications · 593 citations
14
h-index
12 publications · 271 citations
10
h-index
9 publications · 360 citations
9
h-index
6 publications · 165 citations
6
h-index
1–5