Geodesic
Complexity of gating circuits realized by Boolean matrices with undetermined elements
Doklady Akademii Nauk, Tome 163 (1965) no. 1, pp. 40-42.

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

@article{DAN_1965_163_1_a8,
     author = {\'E. I. Nechiporuk},
     title = {Complexity of gating circuits realized by {Boolean} matrices with undetermined elements},
     journal = {Doklady Akademii Nauk},
     pages = {40--42},
     publisher = {mathdoc},
     volume = {163},
     number = {1},
     year = {1965},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1965_163_1_a8/}
}
TY  - JOUR
AU  - É. I. Nechiporuk
TI  - Complexity of gating circuits realized by Boolean matrices with undetermined elements
JO  - Doklady Akademii Nauk
PY  - 1965
SP  - 40
EP  - 42
VL  - 163
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1965_163_1_a8/
LA  - ru
ID  - DAN_1965_163_1_a8
ER  - 
%0 Journal Article
%A É. I. Nechiporuk
%T Complexity of gating circuits realized by Boolean matrices with undetermined elements
%J Doklady Akademii Nauk
%D 1965
%P 40-42
%V 163
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1965_163_1_a8/
%G ru
%F DAN_1965_163_1_a8
É. I. Nechiporuk. Complexity of gating circuits realized by Boolean matrices with undetermined elements. Doklady Akademii Nauk, Tome 163 (1965) no. 1, pp. 40-42. http://geodesic.mathdoc.fr/item/DAN_1965_163_1_a8/