Geodesic
Complexity and the coding of Boolean functions
Doklady Akademii Nauk, Tome 331 (1993) no. 5, pp. 533-535.

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

@article{DAN_1993_331_5_a0,
     author = {A. E. Andreev},
     title = {Complexity and the coding of {Boolean} functions},
     journal = {Doklady Akademii Nauk},
     pages = {533--535},
     publisher = {mathdoc},
     volume = {331},
     number = {5},
     year = {1993},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1993_331_5_a0/}
}
TY  - JOUR
AU  - A. E. Andreev
TI  - Complexity and the coding of Boolean functions
JO  - Doklady Akademii Nauk
PY  - 1993
SP  - 533
EP  - 535
VL  - 331
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1993_331_5_a0/
LA  - ru
ID  - DAN_1993_331_5_a0
ER  - 
%0 Journal Article
%A A. E. Andreev
%T Complexity and the coding of Boolean functions
%J Doklady Akademii Nauk
%D 1993
%P 533-535
%V 331
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1993_331_5_a0/
%G ru
%F DAN_1993_331_5_a0
A. E. Andreev. Complexity and the coding of Boolean functions. Doklady Akademii Nauk, Tome 331 (1993) no. 5, pp. 533-535. http://geodesic.mathdoc.fr/item/DAN_1993_331_5_a0/