Calculation of the permanent of a sparse positive matrix Original Research Article

The exact calculation of permanents of n×n matrices is a non-polynomial computational problem as a function of n. An efficient deterministic algorithm is presented that allows for the approximate calculation of permanents obtained from sparse positive matrices within controllable precision bounds. The upper and lower bounds can be made arbitrarily close to each other and the algorithm outperforms existing ones for sufficiently large matrices.