It is proved that the computation of permanent is #P-hard even for 0-1 matrix.Hence approximate algorithms are the right choice. Permanent computation for general matrix is discussed in this paper. Three Monte-Carlo methods for estimating the permanent of general matrix are presented. Numerical computations and the statistical analysis on the numerical results show t.he efficiency of our methods.
