A mildly exponential approximation algorithm for the permanent
- 1 October 1996
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 16 (4-5) , 392-401
- https://doi.org/10.1007/bf01940871
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An analysis of a Monte Carlo algorithm for estimating the permanentCombinatorica, 1995
- A Monte-Carlo Algorithm for Estimating the PermanentSIAM Journal on Computing, 1993
- Algorithms for Random Generation and Counting: A Markov Chain ApproachPublished by Springer Nature ,1993
- Approximating the PermanentSIAM Journal on Computing, 1989
- How hard is it to marry at random? (On the approximation of the permanent)Published by Association for Computing Machinery (ACM) ,1986
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- Monte-Carlo algorithms for enumeration and reliability problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- The complexity of computing the permanentTheoretical Computer Science, 1979