Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2010), pp. 14-18
Cet article a éte moissonné depuis la source Math-Net.Ru
A method for obtaining new lower estimates for the implementation complexity of individual Boolean functions is presented in the paper. The method is based on the transition from some considered basis to another one possessing already known good lower estimates for the complexity of those functions. The effective use of this method is illustrated on the example of obtaining the asymptotic value for the implementation complexity of threshold functions by self-correcting circuits composed of multiple-input elements.
@article{VMUMM_2010_3_a2,
author = {N. P. Red'kin},
title = {Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {14--18},
year = {2010},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2010_3_a2/}
}
TY - JOUR AU - N. P. Red'kin TI - Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing JO - Vestnik Moskovskogo universiteta. Matematika, mehanika PY - 2010 SP - 14 EP - 18 IS - 3 UR - http://geodesic.mathdoc.fr/item/VMUMM_2010_3_a2/ LA - ru ID - VMUMM_2010_3_a2 ER -
N. P. Red'kin. Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2010), pp. 14-18. http://geodesic.mathdoc.fr/item/VMUMM_2010_3_a2/