On Approximation Algorithms for # P
- 1 November 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (4) , 849-861
- https://doi.org/10.1137/0214060
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- An approximation algorithm for computing the permanentPublished by Springer Nature ,1980
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Estimating the efficiency of backtrack programsMathematics of Computation, 1975