Abstract
Abstract. We show that the counting classes AWPP and APP [FFKL], [L] are more robust than previously thought. Our results identify a sufficient condition for a language to be low for PP, and we show that this condition is at least as weak as other previously studied criteria. We extend a result of Köbler et al. by proving that all sparse co-C = P languages are in APP, and are thus PP-low. Our results also imply that AWPP ⊂eq APP, and thus APP contains many other established subclasses of PP-low, thereby reducing several different lowness results to membership in APP. We also show that AWPP and APP are Σ 0 2 -definable classes. Some of our results are reminiscent of amplifying certainty in probabilistic computation.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fenner, S.A. PP-Lowness and a Simple Definition of AWPP . Theory Comput. Systems 36, 199–212 (2003). https://doi.org/10.1007/s00224-002-1089-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-002-1089-8