Approximating the permanent of graphs with large factors
- 10 August 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 102 (2) , 283-305
- https://doi.org/10.1016/0304-3975(92)90234-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Monte-Carlo approximation algorithms for enumeration problemsJournal of Algorithms, 1989
- Polytopes, permanents and graphs with large factorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated AnnealingProbability in the Engineering and Informational Sciences, 1987
- Eigenvalues and expandersCombinatorica, 1986
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- The complexity of computing the permanentTheoretical Computer Science, 1979