Permanent of a Matrix: the Notion and Computing
Matematičeskoe obrazovanie, no. 2 (2008), pp. 45-49
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/}
}
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/