Complexity of functions from some classes of three-valued logic
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2011), pp. 60-63
Voir la notice de l'article provenant de la source Math-Net.Ru
The problem of the complexity of realization of functions of the three-valued logic taking values from the set $\{0,1\}$ by formulas over incomplete generating systems is considered. Upper and lower asymptotic estimates for the corresponding Shannon functions are obtained.
@article{VMUMM_2011_3_a13,
author = {D. A. Dagaev},
title = {Complexity of functions from some classes of three-valued logic},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {60--63},
publisher = {mathdoc},
number = {3},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2011_3_a13/}
}
D. A. Dagaev. Complexity of functions from some classes of three-valued logic. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 3 (2011), pp. 60-63. http://geodesic.mathdoc.fr/item/VMUMM_2011_3_a13/