Properties and proof techniques for general probabilistic complexity classes are discussed. Two versions of probability amplification lemmas that connect probabilisitic complexity classes with nonuniform classes are presented. The quantifier simulation technique, which makes it possible to express assertions that hold with high probability by two alternating quantifiers, is introduced. Quantifier simulation is the key technique for proving several lowness properties of probabilistic complexity classes.
CITATION STYLE
Schoning, U. (1987). PROBABILISTIC COMPLEXITY CLASSES AND LOWNESS. (pp. 2–8). IEEE. https://doi.org/10.1109/psct.1987.10319246
Mendeley helps you to discover research relevant for your work.