摘要
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.
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 the efficiency of our methods.
出处
《数值计算与计算机应用》
CSCD
北大核心
2004年第3期174-182,共9页
Journal on Numerical Methods and Computer Applications
基金
国家自然科学基金(G10228101)
国家重点基础研究基金(G1998020306)资助.
