Permanent of a Matrix: the Notion and Computing
Matematičeskoe obrazovanie, no. 2 (2008), pp. 45-49
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Different ways of computing permanent of a matrix are discussed, the measure of laboriousness of computing is estimated. For a square matrix, an elementary derivation of Raiser formula is given.
@article{MO_2008_2_a4,
     author = {A. Yu. Evnin},
     title = {Permanent of a {Matrix:} the {Notion} and {Computing}},
     journal = {Matemati\v{c}eskoe obrazovanie},
     pages = {45--49},
     year = {2008},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MO_2008_2_a4/}
}
TY  - JOUR
AU  - A. Yu. Evnin
TI  - Permanent of a Matrix: the Notion and Computing
JO  - Matematičeskoe obrazovanie
PY  - 2008
SP  - 45
EP  - 49
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MO_2008_2_a4/
LA  - ru
ID  - MO_2008_2_a4
ER  - 
%0 Journal Article
%A A. Yu. Evnin
%T Permanent of a Matrix: the Notion and Computing
%J Matematičeskoe obrazovanie
%D 2008
%P 45-49
%N 2
%U http://geodesic.mathdoc.fr/item/MO_2008_2_a4/
%G ru
%F MO_2008_2_a4
A. Yu. Evnin. Permanent of a Matrix: the Notion and Computing. Matematičeskoe obrazovanie, no. 2 (2008), pp. 45-49. http://geodesic.mathdoc.fr/item/MO_2008_2_a4/