Logic Minimization
Logic Minimization is a method in digital circuit design that reduces the complexity of Boolean expressions to minimize the number of logic gates and interconnections required for their implementation.
393
Publications
19.4K
Citations
682
Authors
282
Institutions
Publications per year
2017–2026
32
Parents
393
Minimization of Boolean Functions*
E.J. McCluskey · Bell System Technical Journal · 1956 · 1.2K citations
Cascode voltage switch logic: A differential CMOS logic family
L.G. Heller, W. Paul Griffin, Jack Davis et al. · 1984 · 482 citations
Engineering, Computer Engineering, Electrical Engineering +14
1–5 of 393
682
University of California, Berkeley, United States
17 publications · 2.5K citations
17
h-index
17
h-index
11
h-index
10
h-index
10
h-index
1–5 of 682
282
University of California, Berkeley
Berkeley, United States
27 h-index
88 publications
7.6K citations
University of Illinois Urbana-Champaign
Urbana, United States
11 h-index
24 publications
1.6K citations
University of California, Santa Barbara
Santa Barbara, United States
11 h-index
15 publications
923 citations
University of Southern California
Los Angeles, United States
10 h-index
18 publications
635 citations

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

University of Pisa
Pisa, Italy
10 h-index
19 publications
375 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
8 h-index
22 publications
673 citations

Indian Institute of Science Bangalore
Bengaluru, India
8 h-index
12 publications
195 citations
1–8 of 282
46 publications · 3.7K citations
28
h-index
35 publications · 1.4K citations
22
h-index
12 publications · 596 citations
10
h-index
Conference · 6 publications · 250 citations
6
h-index
4 publications · 661 citations
4
h-index
1–5