A mildly exponential approximation algorithm for the permanent
- Cite this article as:
- Jerrum, M. & Vazirani, U. Algorithmica (1996) 16: 392. doi:10.1007/BF01940871
A new approximation algorithm for the permanent of ann ×n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n1/2 log2n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity exp(Θ(n)).