A survey on counting classes

Consideration is given to polynomial-time machines. Among these classes are EP and PP. The authors prove P/sup EP(log)/ 25 PP, investigate the Boolean closure BC(EP) of EP, and give a relativization principle which allows them to completely separate BC(EP) in a suitable relativized world and to give simple proofs for known relativization results. Further results concerning the relationships of such classes in unrelativized and relativized worlds are given.<<ETX>>

[1]  Jin-Yi Cai,et al.  Enumerative counting is hard , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[2]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[3]  Gerd Wechsung,et al.  Counting classes with finite acceptance types , 1987 .

[4]  Gerd Wechsung,et al.  Nondeterministic Turing Machines with Modified Acceptance , 1986, MFCS.

[5]  Dieter Rödding.  Anzahlquantoren in der Kleene-Hierarchie , 1966 .

[6]  Andreas Blass,et al.  On the Unique Satisfiability Problem , 1982, Inf. Control..

[7]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  Juris Hartmanis,et al.  The Boolean Hierarchy II: Applications , 1989, SIAM J. Comput..

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

[10]  Martin Weese.  Generalized Ehrenfeucht games , 1980 .

[11]  Uwe Schöning.  The power of counting , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[12]  Dana Angluin,et al.  On Counting Problems and the Polynomial-Time Hierarchy , 1980, Theor. Comput. Sci..

[13]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

[14]  Jacobo Torán,et al.  On Counting and Approximation , 1988, CAAP.

[15]  John Derrick,et al.  Meeting of the Association for Symbolic Logic Leeds 1967 , 1968, J. Symb. Log..

[16]  Jin-Yi Cai,et al.  On the Power of Parity Polynomial Time , 1989, STACS.

[17]  Lane A. Hemaspaandra,et al.  On the power of probabilistic polynomial time: P/sup NP(log)/ contained in PP , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[18]  Richard Beigel,et al.  Relativized Counting Classes: Relations among Thresholds, Parity, and Mods , 1991, J. Comput. Syst. Sci..