Inversion complexity of self-correcting surcuits for a certain sequence of Boolean functions}  / T. I. Krasnova. //Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. 2012. ? 3. P. 58-61 [Moscow Univ. Math. Bulletin. Vol. 67, N 3, 2012.].

It is stated that the inversion complexity L_k^-(ƒ_n²) of monotone symmetric Boolean functions ƒ_n²(x₁,...,x_n)=∨_{(1≤i<j≤n)}x_ix_j by k-self-correcting schemes in the basis B={&,-} for growing $n$ asymptotically equals ;n min{k+1, p} when the price of a reliable inventor p ≥ 1 and k are fixed.

Key words: circuits of functional elements, monotone symmetric Boolean functions, inversion complexity, self-correcting circuit.