Classes of Counting Functions and Complexity Theoretic Operators

[1]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[2]  Lane A. Hemaspaandra,et al.  A Complexity Theory for Feasible Closure Properties , 1991, J. Comput. Syst. Sci..

[3]  Osamu Watanabe,et al.  Polynomial Time 1-Turing Reductions from #PH to #P , 1992, Theor. Comput. Sci..

[4]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[5]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[6]  Christos H. Papadimitriou,et al.  Two remarks on the power of counting , 1983, Theoretical Computer Science.

[7]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..