Can anyone estimate the number of operations for computation of matrix permanent with a given accuracy?

It is well known that Ryser's algorithm requires O(Nx2^N) operations for computation of a matrix permanent of a square complex matrix of size NxN on an *ideal computer with exact arithmetics*....

04 April 2015 3,318 2 View