This site won't be updated anymore.
Actual information is available on vestnik.math.msu.su

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. 69, N 3, 2014.].

It is stated that the conjunction complexity L_k^&(f₂ⁿ) of monotone symmetric Boolean functions f₂ⁿ(x₁,..., x_n) = V_1≤i<j≤n x_i x_j 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.