Geodesic
The best asymptotic representation of Boolean functions by information graphs
Diskretnaya Matematika, Tome 23 (2011) no. 4, pp. 80-102

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

@article{DM_2011_23_4_a5,
     author = {Yu. S. Shutkin},
     title = {The best asymptotic representation of {Boolean} functions by information graphs},
     journal = {Diskretnaya Matematika},
     pages = {80--102},
     publisher = {mathdoc},
     volume = {23},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2011_23_4_a5/}
}
TY  - JOUR
AU  - Yu. S. Shutkin
TI  - The best asymptotic representation of Boolean functions by information graphs
JO  - Diskretnaya Matematika
PY  - 2011
SP  - 80
EP  - 102
VL  - 23
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2011_23_4_a5/
LA  - ru
ID  - DM_2011_23_4_a5
ER  - 
%0 Journal Article
%A Yu. S. Shutkin
%T The best asymptotic representation of Boolean functions by information graphs
%J Diskretnaya Matematika
%D 2011
%P 80-102
%V 23
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2011_23_4_a5/
%G ru
%F DM_2011_23_4_a5
Yu. S. Shutkin. The best asymptotic representation of Boolean functions by information graphs. Diskretnaya Matematika, Tome 23 (2011) no. 4, pp. 80-102. http://geodesic.mathdoc.fr/item/DM_2011_23_4_a5/