Incomparable integrals and approximate calculation of monotone Boolean functions
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2017), pp. 51-55
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The number of incomparable $k$-dimensional intervals in the Boolean $n$-cube is estimated. The result is used to estimate the complexity of approximate computation of an arbitrary monotone Boolean function of $n$ variables.
[1] Ugolnikov A.B., “O realizatsii monotonnykh funktsii skhemami iz funktsionalnykh elementov”, Problemy kibernetiki, 31, Nauka, M., 1976, 167–185 | MR
[2] Lupanov O.B., “Ob odnom podkhode k sintezu upravlyayuschikh sistem — printsipe lokalnogo kodirovaniya”, Problemy kibernetiki, 14, Nauka, M., 1965, 31–110
[3] Sholomov L.A., “O realizatsii nedoopredelennykh bulevykh funktsii skhemami iz funktsionalnykh elementov”, Problemy kibernetiki, 21, Nauka, M., 1969, 215–226