Probabilistic and Deterministic Approximations of the Permanent
The exact computation of the permanent of a matrix is #P-complete. Many efforts have been made to efficiently approximate the permanent. In this talk we will survey some of these methods, both probabilistic and deterministic.
The papers below and the references within them serve as a good source of information on this topic.
- 3.Feige, U., Lund, C.: On the hardness of computing the permanent of random matrices. STOC 24, 643–654 (1992)Google Scholar