Geodesic
Information complexity of problems associated with minimal realization of Boolean functions by networks
Doklady Akademii Nauk, Tome 200 (1971) no. 3, pp. 556-559.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DAN_1971_200_3_a13,
     author = {L. A. Sholomov},
     title = {Information complexity of problems associated with minimal realization of {Boolean} functions by networks},
     journal = {Doklady Akademii Nauk},
     pages = {556--559},
     publisher = {mathdoc},
     volume = {200},
     number = {3},
     year = {1971},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1971_200_3_a13/}
}
TY  - JOUR
AU  - L. A. Sholomov
TI  - Information complexity of problems associated with minimal realization of Boolean functions by networks
JO  - Doklady Akademii Nauk
PY  - 1971
SP  - 556
EP  - 559
VL  - 200
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1971_200_3_a13/
LA  - ru
ID  - DAN_1971_200_3_a13
ER  - 
%0 Journal Article
%A L. A. Sholomov
%T Information complexity of problems associated with minimal realization of Boolean functions by networks
%J Doklady Akademii Nauk
%D 1971
%P 556-559
%V 200
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1971_200_3_a13/
%G ru
%F DAN_1971_200_3_a13
L. A. Sholomov. Information complexity of problems associated with minimal realization of Boolean functions by networks. Doklady Akademii Nauk, Tome 200 (1971) no. 3, pp. 556-559. http://geodesic.mathdoc.fr/item/DAN_1971_200_3_a13/