On the complexity of the realization of Boolean functions with a small number of ones by self-correcting switching circuits
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 1 (2011), pp. 19-21
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{VMUMM_2011_1_a2,
author = {N. P. Red'kin},
title = {On the complexity of the realization of {Boolean} functions with a small number of ones by self-correcting switching circuits},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {19--21},
publisher = {mathdoc},
number = {1},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2011_1_a2/}
}
TY - JOUR AU - N. P. Red'kin TI - On the complexity of the realization of Boolean functions with a small number of ones by self-correcting switching circuits JO - Vestnik Moskovskogo universiteta. Matematika, mehanika PY - 2011 SP - 19 EP - 21 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMUMM_2011_1_a2/ LA - ru ID - VMUMM_2011_1_a2 ER -
%0 Journal Article %A N. P. Red'kin %T On the complexity of the realization of Boolean functions with a small number of ones by self-correcting switching circuits %J Vestnik Moskovskogo universiteta. Matematika, mehanika %D 2011 %P 19-21 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/item/VMUMM_2011_1_a2/ %G ru %F VMUMM_2011_1_a2
N. P. Red'kin. On the complexity of the realization of Boolean functions with a small number of ones by self-correcting switching circuits. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 1 (2011), pp. 19-21. http://geodesic.mathdoc.fr/item/VMUMM_2011_1_a2/