RUS  ENG
Full version
JOURNALS // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika // Archive

Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2011 Number 1, Pages 19–21 (Mi vmumm649)

This article is cited in 2 papers

Mathematics

On the complexity of the realization of Boolean functions with a small number of ones by self-correcting switching circuits

N. P. Red'kin

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

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

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

UDC: 519.95

Received: 17.03.2009


 English version:
Moscow University Mathematics Bulletin, Moscow University Måchanics Bulletin, 2011, 66:1, 17–19

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026