On counting problems and the polynomial-time hierarchy

Adleman, 1977, Reducibility, randomness, and intractability, Proc. 9th Annual ACM Symposium on Theory of Computing, 151 Baker, 1975, Relativizations of the P=?NP question, SIAM J. Comput., 4, 431, 10.1137/0204037 Baker, 1979, A second step toward the polynomial hierarchy, Theoret. Comput. Sci., 8, 177, 10.1016/0304-3975(79)90043-4 Gill, 1977, Computational complexity of probabilistic Turing machines, SIAM J. Comput., 6, 675, 10.1137/0206049 Máthon, 1979, A note on the graph isomorphism counting problem, Information Processing Lett., 8, 131, 10.1016/0020-0190(79)90004-8 Miller, 1975, Riemann's hypothesis and tests for primality Rackoff, 1978, Relativized questions involving probabilistic algorithms, Proc. 10th Annual ACM Symposium on Theory of Computing, 338 Solovay, 1977, A fast Monte-Carlo test for primality, Siam J. Comput., 6, 84, 10.1137/0206006 Solovay, 1978, Erratum, Siam J. Comput., 7, 118, 10.1137/0207009 Stockmeyer, 1977, The polynomial-time hierarchy, Theoret. Comput. Sci., 3, 1, 10.1016/0304-3975(76)90061-X Valiant, 1979, The complexity of computing the permanent, Theoret. Comput. Sci., 8, 189, 10.1016/0304-3975(79)90044-6 Valiant, 1979, The complexity of reliability and enumeration problems, SIAM J. Comput., 8, 410, 10.1137/0208032 Wrathall, 1977, Complete sets and the polynomial hierarchy, Theoret. Comput. Sci., 3, 23, 10.1016/0304-3975(76)90062-1