Geodesic
On the complexity of Boolean matrices, graphs and their corresponding Boolean functions
Diskretnaya Matematika, Tome 6 (1994) no. 2, pp. 43-73.

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

@article{DM_1994_6_2_a2,
     author = {A. V. Chashkin},
     title = {On the complexity of {Boolean} matrices, graphs and their corresponding {Boolean} functions},
     journal = {Diskretnaya Matematika},
     pages = {43--73},
     publisher = {mathdoc},
     volume = {6},
     number = {2},
     year = {1994},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1994_6_2_a2/}
}
TY  - JOUR
AU  - A. V. Chashkin
TI  - On the complexity of Boolean matrices, graphs and their corresponding Boolean functions
JO  - Diskretnaya Matematika
PY  - 1994
SP  - 43
EP  - 73
VL  - 6
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1994_6_2_a2/
LA  - ru
ID  - DM_1994_6_2_a2
ER  - 
%0 Journal Article
%A A. V. Chashkin
%T On the complexity of Boolean matrices, graphs and their corresponding Boolean functions
%J Diskretnaya Matematika
%D 1994
%P 43-73
%V 6
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1994_6_2_a2/
%G ru
%F DM_1994_6_2_a2
A. V. Chashkin. On the complexity of Boolean matrices, graphs and their corresponding Boolean functions. Diskretnaya Matematika, Tome 6 (1994) no. 2, pp. 43-73. http://geodesic.mathdoc.fr/item/DM_1994_6_2_a2/