A hybrid algorithm for computing permanents of sparse matrices (Q2369215)

For computing permanents of sparse matrices, a hybrid algorithm is proposed. The new method is constructed by combining an improved direct expansion method with a method due to Ryser and later improved by Nijenhuis and Wilf (named R-NW in this paper). In the worst case, the computational complexity of the hybrid algorithm is the same as that of R-NW. Numerical examples show that it saves drastically by using structural information of matrices.