Complexity of Realization of Boolean Functions with Small Number of Unit Values by Selfcorrecting Contact Circuits / Red'kin N.P. // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. 2011. ? 1. P. 19-21 [Moscow Univ. Math. Bulletin. Vol. 66, No 1, 2011. P. 17-19].

An asymptotics for the complexity of realization of Boolean functions taking the unit value on a comparatively small set of collections of variables by self-correcting contact circuits is obtained.

Key words: Boolean functions, contact networks, self-correcting schemes, complexity of implementation of functions.