Computing the Permanents of Matrices with Applications
<br>
Fengshan BAI

Department of Mathematical Sciences, Tsinghua University, 

Beijing, 100084, P.R.CHINA.

fbai@math.tsinghua.edu.cn

<br>
The permanents of a matrix is introduced. It looks similar to 
the determinant. But its computational complexity is #P-C. 
There are wide applications of the permanent in combinatorial
counting, graph theory and statistic physics. It is also an
interested structural invariant in computational molecular
chemistry.

<br>

This work is concentrated on the computation of the permanents of
adjacency matrices of fullerenes. They are all (0,1) sparse matrices.
The comparisons of several alternative algorithms are also presented.