Circuit Minimization is a computational problem in circuit complexity that consists in finding the smallest Boolean circuit, measured by the number of gates or circuit size, that computes a given Boolean function.
214
Publications
10.5K
Citations
424
Authors
204
Institutions
Publications per year
2017–2026
16
Variants
Boolean Circuit Minimization
Parents
Publications
214
Minimization of Boolean Functions*
E.J. McCluskey · Bell System Technical Journal · 1956 · 1.2K citations
Finding a Minimum Circuit in a Graph
Alon Itai, Michael Rodeh · SIAM Journal on Computing · 1978 · 397 citations
1–5 of 214
Authors
424
- MP
6
h-index
- RK
6
h-index
- RD
5
h-index
- SM
4
h-index
- SB
4
h-index
1–5 of 424
Institutions
204
University of California, Berkeley
Berkeley, United States
11 h-index
28 publications
2.3K citations
University of Illinois Urbana-Champaign
Urbana, United States
11 h-index
23 publications
1.4K citations
Portland State University
Portland, United States
8 h-index
20 publications
970 citations
IBM (United States)
Armonk, United States
7 h-index
27 publications
2.3K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
7 h-index
14 publications
1.2K citations
Princeton University
Princeton, United States
5 h-index
5 publications
113 citations
National Tsing Hua University
Hsinchu, Taiwan
5 h-index
7 publications
137 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
10 publications
618 citations
1–8 of 204
Venues
- IEEE Transactions on Computers
28 publications · 1.1K citations
18
h-index
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
22 publications · 1.1K citations
16
h-index
- IEEE Transactions on Circuits and Systems
7 publications · 335 citations
7
h-index
- IBM Journal of Research and Development
5 publications · 692 citations
5
h-index
- IEEE Transactions on Electronic Computers
5 publications · 196 citations
5
h-index
1–5