| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4636258 | Applied Mathematics and Computation | 2007 | 13 Pages |
Abstract
The permanent of matrix is important in mathematics and applications. Its computation, however, is #P-complete. Randomized algorithms are natural consideration to deal with such kind of problems. A Monte Carlo algorithm for approximating permanents of matrices is proposed in this paper, which improves a method by Rasmussen. Mathematical analysis and numerical computations show the efficiency of the method.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Heng Liang, Linsong Shi, Fengshan Bai, Xiaoyan Liu,