Abstract:
Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades.
Many results have been obtained, and many papers published. However, until now there has been no sufficiently complete monograph or survey of results of investigations concerning monotone Boolean functions. The object of this survey is to present the main results on monotone Boolean functions obtained during the last 50 years.
This publication is cited in the following 46 articles:
Yuxiang Yao, Zi-Gang Huang, Duanqing Pei, “Diversified dynamic effects and their order origins in Boolean functions”, Chaos, Solitons & Fractals, 191 (2025), 115830
A. J. Gutknecht, A. Makkeh, M. Wibral, “From Babel to Boole: the logical organization of information decompositions”, Proc. R. Soc. A., 481:2310 (2025)
Levon Aslanyan, Gyula Katona, Hasmik Sahakyan, “Shadow Minimization Boolean Function Reconstruction”, Informatica, 2024, 1
H. Sahakyan, L. Aslanyan, “Alternative Approaches of Solving the Discrete Tomography”, Program Comput Soft, 50:S1 (2024), S75
Movsisyan Yu.M., “Boole-de Morgan Bilattices”, J. Mult.-Valued Log. Soft Comput., 38:1-2 (2022), 137–152
Yu. G. Tarazevich, “On the complexity of realizations of Boolean functions in some classes of hypercontact circuits”, Discrete Math. Appl., 34:1 (2024), 33–50
Peter Crawford-Kahrl, Bree Cummins, Tomáš Gedeon, “Joint realizability of monotone Boolean functions”, Theoretical Computer Science, 922 (2022), 447
Tennakoon R., Suter D., Zhang E., Chin T.-J., Bab-Hadiashar A., “Consensus Maximisation Using Influences of Monotone Boolean Functions”, 2021 IEEE/Cvf Conference on Computer Vision and Pattern Recognition, Cvpr 2021, IEEE Conference on Computer Vision and Pattern Recognition, IEEE Computer Soc, 2021, 2865–2874
Kurz S., “A Note on the Growth of the Dimension in Complete Simple Games”, Math. Soc. Sci., 110 (2021), 14–18
Gedeon T., “Multi-Parameter Exploration of Dynamics of Regulatory Networks”, Biosystems, 190 (2020), 104113
Shmulevich I., “On the Lyapunov Exponent of Monotone Boolean Networks Dagger”, Mathematics, 8:6 (2020), 1035
Farras O., “Secret Sharing Schemes For Ports of Matroids of Rank 3”, Kybernetika, 56:5 (2020), 903–915
Morton W., van Alten C.J., “Distributive and Completely Distributive Lattice Extensions of Ordered Sets”, Int. J. Algebr. Comput., 28:3 (2018), 521–541
Movsisyan Yu.M., “Hyperidentities and Related Concepts, II”, Armen. J. Math., 10:4 (2018), 1–85
Pauly A., “Parameterized Games and Parameterized Automata”, Electron. Proc. Theor. Comput. Sci., 2018, no. 277, 30–42
O. N. Muzychenko, “About complexity of implementing threshold functions”, Russian Math. (Iz. VUZ), 61:7 (2017), 35–42
Gainer-Dewar A., Vera-Licona P., “The Minimal Hitting Set Generation Problem: Algorithms and Computation”, SIAM Discret. Math., 31:1 (2017), 63–100
Pendavingh R., van der Pol J., “Enumerating Matroids of Fixed Rank”, Electron. J. Comb., 24:1 (2017), P1.8
Movsisyan Yu.M., “Hyperidentities and Related Concepts, i”, Armen. J. Math., 9:2 (2017), 146–222
Tournier L., Goelzer A., Fromion V., “Optimal Resource Allocation Enables Mathematical Exploration of Microbial Metabolic Configurations”, J. Math. Biol., 75:6-7 (2017), 1349–1380
Citation in format AMSBIB
Contact us: