Monotone Boolean Functions
Monotone Boolean Functions is a class of Boolean functions in which the output does not decrease when any input variable changes from 0 to 1, distinguishing it from general Boolean functions by preserving the partial order of inputs under component-wise comparison.
168
Publications
6.2K
Citations
253
Authors
172
Institutions
Publications per year
2017–2026
20
Variants
Monotone Boolean Function
Parents
168
The monotone circuit complexity of boolean functions
Noga Alon, Ravi B. Boppana · COMBINATORICA · 1987 · 350 citations
Monotonicity testing over general poset domains
Eldar Fischer, Eric Lehman, Ilan Newman et al. · 2002 · 196 citations
Extracting rules from trained neural networks
Hiroshi Tsukimoto · IEEE Transactions on Neural Networks · 2000 · 167 citations
1–5 of 168
253
7
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 253
172
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
13 publications
1.2K citations
Columbia University
New York, United States
8 h-index
17 publications
596 citations
Technion – Israel Institute of Technology
Haifa, Israel
6 h-index
9 publications
331 citations
Henan Polytechnic University
Jiaozuo, China
6 h-index
9 publications
220 citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
10 publications
671 citations
Princeton University
Princeton, United States
6 h-index
6 publications
321 citations

University of Toronto
Toronto, Canada
6 h-index
10 publications
369 citations

Weizmann Institute of Science
Rehovot, Israel
5 h-index
6 publications
134 citations
1–8 of 172
Repository · 8 publications · 176 citations
8
h-index
7 publications · 178 citations
7
h-index
7 publications · 169 citations
7
h-index
7 publications · 338 citations
7
h-index
5 publications · 211 citations
5
h-index
1–5