Bounds for the depth of decision trees that compute Boolean
Doklady Akademii Nauk, Tome 350 (1996) no. 1, pp. 22-24.

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

@article{DAN_1996_350_1_a5,
     author = {M. Yu. Moshkov},
     title = {Bounds for the depth of decision trees that compute {Boolean}},
     journal = {Doklady Akademii Nauk},
     pages = {22--24},
     publisher = {mathdoc},
     volume = {350},
     number = {1},
     year = {1996},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1996_350_1_a5/}
}
TY  - JOUR
AU  - M. Yu. Moshkov
TI  - Bounds for the depth of decision trees that compute Boolean
JO  - Doklady Akademii Nauk
PY  - 1996
SP  - 22
EP  - 24
VL  - 350
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1996_350_1_a5/
LA  - ru
ID  - DAN_1996_350_1_a5
ER  - 
%0 Journal Article
%A M. Yu. Moshkov
%T Bounds for the depth of decision trees that compute Boolean
%J Doklady Akademii Nauk
%D 1996
%P 22-24
%V 350
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1996_350_1_a5/
%G ru
%F DAN_1996_350_1_a5
M. Yu. Moshkov. Bounds for the depth of decision trees that compute Boolean. Doklady Akademii Nauk, Tome 350 (1996) no. 1, pp. 22-24. http://geodesic.mathdoc.fr/item/DAN_1996_350_1_a5/