Polynomial algorithms for computing the permanents of some matrices
Diskretnaya Matematika, Tome 9 (1997) no. 3, pp. 96-100.

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

Let $B_n$ be the matrix whose columns are all $n$-dimensional non-zero Boolean vectors and let $B_{nk}$ be the matrix whose columns are all $n$-dimensional Boolean vectors with $k$ unities. We suggest polynomial with respect to $n$ algorithms to compute the permanents of these matrices and some related matrices. These algorithms are based on the generating functions for values of permanents of the matrices under consideration.
@article{DM_1997_9_3_a7,
     author = {A. P. Il'ichev and G. P. Kogan and V. N. Shevchenko},
     title = {Polynomial algorithms for computing the permanents of some matrices},
     journal = {Diskretnaya Matematika},
     pages = {96--100},
     publisher = {mathdoc},
     volume = {9},
     number = {3},
     year = {1997},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1997_9_3_a7/}
}
TY  - JOUR
AU  - A. P. Il'ichev
AU  - G. P. Kogan
AU  - V. N. Shevchenko
TI  - Polynomial algorithms for computing the permanents of some matrices
JO  - Diskretnaya Matematika
PY  - 1997
SP  - 96
EP  - 100
VL  - 9
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1997_9_3_a7/
LA  - ru
ID  - DM_1997_9_3_a7
ER  - 
%0 Journal Article
%A A. P. Il'ichev
%A G. P. Kogan
%A V. N. Shevchenko
%T Polynomial algorithms for computing the permanents of some matrices
%J Diskretnaya Matematika
%D 1997
%P 96-100
%V 9
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1997_9_3_a7/
%G ru
%F DM_1997_9_3_a7
A. P. Il'ichev; G. P. Kogan; V. N. Shevchenko. Polynomial algorithms for computing the permanents of some matrices. Diskretnaya Matematika, Tome 9 (1997) no. 3, pp. 96-100. http://geodesic.mathdoc.fr/item/DM_1997_9_3_a7/