An approximation algorithm for computing the permanent
- 1 January 1980
- book chapter
- Published by Springer Nature
- p. 141-147
- https://doi.org/10.1007/bfb0088907
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Monte Carlo MethodsPublished by Springer Nature ,1964