Incomparable Integrals and Approximate Calculation of Monotone Boolean Functions / A. V. Chashkin. // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. 2017. № 5. P. 51-55 [Moscow Univ. Math. Bulletin. Vol. 72, N 2, 2017. P. 206-209].

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.

Key words: monotone Boolean function, complexity of approximate computation, incomparable intervals.

№ 5/2017