Boolean Functions is a mathematical function in propositional logic that maps a set of binary input values to a single binary output value according to a specific logical rule.
3K
Publications
155.8K
Citations
5K
Authors
1.5K
Institutions
Publications per year
2017–2026
516
Variants
Boolean Function
Parents
Publications
3K
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Matthew W. Moskewicz, Conor Madigan, Ying Zhao et al. · 2001 · 2.9K citations
Minimization of Boolean Functions*
E.J. McCluskey · Bell System Technical Journal · 1956 · 1.2K citations
1–5 of 3K
Authors
5K
- CC
24
h-index
- MP
19
h-index
- RD
19
h-index
- SM
19
h-index
- RA
18
h-index
1–5 of 5K
Institutions
1.5K
Carnegie Mellon University
Pittsburgh, United States
34 h-index
100 publications
18K citations
Chinese Academy of Sciences
Beijing, China
32 h-index
148 publications
11.3K citations
University of California, Berkeley
Berkeley, United States
31 h-index
131 publications
11.2K citations
Centre National de la Recherche Scientifique
Paris, France
28 h-index
97 publications
3.3K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
26 h-index
65 publications
3.5K citations
Princeton University
Princeton, United States
26 h-index
67 publications
11.9K citations
Université Paris 8
Paris, France
25 h-index
52 publications
1.9K citations
Portland State University
Portland, United States
24 h-index
81 publications
3.9K citations
1–8 of 1.5K
Venues
- IEEE Transactions on Information Theory
93 publications · 4.8K citations
41
h-index
- IEEE Transactions on Computers
94 publications · 13.8K citations
37
h-index
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
65 publications · 3.9K citations
32
h-index
- SIAM Journal on Computing
52 publications · 3.7K citations
29
h-index
- arXiv (Cornell University)
Repository · 57 publications · 2.5K citations
23
h-index
1–5