Asymptotic behavior of conjunction complexity of self-correcting circuits for monotone symmetric functions with threshold 2 / T. I. Krasnova. // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. 2014. № 3. P. 50-54 [Moscow Univ. Math. Bulletin. Vol. 72, N 2, 2017. P. 0].

It is stated that the conjunction complexity Lk&(f2n) of monotone symmetric Boolean functions f2n(x1,..., xn) = V1≤i<j≤n xi xj realized by k-self-correcting circuits in the basis B = {&, - } asymptotically equals (k+2)n for growing n when the price of a reliable conjunctor is ≥ k+2.

Key words: circuits, monotonic symmetric Boolean functions, conjunction complexity, self-correcting circuit.

№ 3/2014