We consider inclusion relations among a multitude of classical complexity classes and classes with probabilistic components. A key tool is a method for characterizing such classes in terms of the ordinary quantifiers ∃ and ∀ together with a quantifier ∃+, which means roughly “for most”, applied to polynomial-time predicates. This approach yields a uniform treatment which leads to easier proofs for class-inclusion and hierarchy-collapse results. Furthermore the method captures some recently introduced game classes and game hierarchies. This survey also includes a charting of class-inclusion and oracle-based separation results.
CITATION STYLE
Zachos, S. (1986). Probabilistic quantifiers, adversaries, and complexity classes : An overview. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 223 LNCS, pp. 383–400). Springer Verlag. https://doi.org/10.1007/3-540-16486-3_112
Mendeley helps you to discover research relevant for your work.