Geodesic
On the complexity of narrow systems of Boolean functions
Diskretnaya Matematika, Tome 11 (1999) no. 3, pp. 149-159.

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

We consider the complexity of generating systems of Boolean vectors by circuits. The unit vectors are used as the initial vectors called generators. We investigate the behaviour of the Shannon function of the complexity of systems in the case, where the number of vectors in the systems and the logarithm of their dimension are of the same order, and obtain an asymptotically exact formula for the Shannon function.The research was supported by the Russian Foundation for Basic Research, grant 96–01–01068, and the Federal Program ‘Integration’, grant 473. 
@article{DM_1999_11_3_a12,
     author = {A. V. Chashkin},
     title = {On the complexity of narrow systems of {Boolean} functions},
     journal = {Diskretnaya Matematika},
     pages = {149--159},
     publisher = {mathdoc},
     volume = {11},
     number = {3},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1999_11_3_a12/}
}
TY  - JOUR
AU  - A. V. Chashkin
TI  - On the complexity of narrow systems of Boolean functions
JO  - Diskretnaya Matematika
PY  - 1999
SP  - 149
EP  - 159
VL  - 11
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1999_11_3_a12/
LA  - ru
ID  - DM_1999_11_3_a12
ER  - 
%0 Journal Article
%A A. V. Chashkin
%T On the complexity of narrow systems of Boolean functions
%J Diskretnaya Matematika
%D 1999
%P 149-159
%V 11
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1999_11_3_a12/
%G ru
%F DM_1999_11_3_a12
A. V. Chashkin. On the complexity of narrow systems of Boolean functions. Diskretnaya Matematika, Tome 11 (1999) no. 3, pp. 149-159. http://geodesic.mathdoc.fr/item/DM_1999_11_3_a12/