On counting problems and the polynomial-time hierarchy
- 31 October 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 12 (2), 161-173
- https://doi.org/10.1016/0304-3975(80)90027-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- A note on the graph isomorphism counting problemInformation Processing Letters, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Erratum: A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1978
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975