The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
PP is as Hard as the Polynomial-Time Hierarchy
Abstract
In this paper, two interesting complexity classes, PP and $ \oplus {\text{P}}$, are compared with PH, the polynomial-time hierarchy. It is shown that every set in PH is polynomial-time Turing reducible to a set in PP, and PH is included in ${\text{BP}} \cdot \oplus {\text{P}}$. As a consequence of the results, it follows that ${\text{PP}} \subseteq {\text{PH}}$ (or $\oplus {\text{P}} \subseteq {\text{PH}}$) implies a collapse of PH. A stronger result is also shown: every set in PP(PH) is polynomial-time Turing reducible to a set in PP.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
The Complexity of Enumeration and Reliability Problems
Valiant, L. G. (1979) · SIAM Journal on Computing · doi:10.1137/0208032 · Cited by 2,076
Stockmeyer, L. J. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90061-x · Cited by 1,293
Computational Complexity of Probabilistic Turing Machines
Gill, J. (1977) · SIAM Journal on Computing · doi:10.1137/0206049 · Cited by 689
NP is as easy as detecting unique solutions
Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90135-0 · Cited by 635
Complete sets and the polynomial-time hierarchy
Wrathall, C. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90062-1 · Cited by 394
The complexity of combinatorial problems with succinct input representation
Wagner, K. W. (1986) · Acta Informatica · doi:10.1007/bf00289117 · Cited by 285
Relative complexity of checking and evaluating
Valiant, L. G. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90097-1 · Cited by 277
On Approximation Algorithms for # P
Stockmeyer, L. (1985) · SIAM Journal on Computing · doi:10.1137/0214060 · Cited by 216
BPP and the polynomial hierarchy
Lautemann, C. (1983) · Information Processing Letters · doi:10.1016/0020-0190(83)90044-3 · Cited by 212
Probabilistic complexity classes and lowness
Schöning, U. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90020-2 · Cited by 117
On the difference between one and many: preliminary version
Šimon, J. (1977) · Lecture notes in computer science · doi:10.1007/3-540-08342-1_37 · Cited by 113
The polynomial-time hierarchy and sparse oracles
Balcázar, J. L., Book, R. V., & Schöning, U. (1986) · Journal of the ACM · doi:10.1145/5925.5937 · Cited by 86
Some observations on the probabilistic algorithms and NP-hard problems
Ko, K. (1982) · Information Processing Letters · doi:10.1016/0020-0190(82)90139-9 · Cited by 82
Relativizing complexity classes with sparse oracles
Long, T. J., & Selman, A. L. (1986) · Journal of the ACM · doi:10.1145/5925.5938 · Cited by 78
On counting problems and the polynomial-time hierarchy
Angluin, D. (1980) · Theoretical Computer Science · doi:10.1016/0304-3975(80)90027-4 · Cited by 70
A decisive characterization of BPP
Zachos, S., & Heller, H. (1986) · Information and Control · doi:10.1016/s0019-9958(86)80044-4 · Cited by 57
Some observations on the connection between counting and recursion
Wagner, K. W. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90141-6 · Cited by 48
Köbler, J., Schöning, U., & Torán, J. (1989) · Acta Informatica · doi:10.1007/bf00276023 · Cited by 44
On the power of parity polynomial time
Cai, J., & Hemaspaandra, L. A. (2005) · Springer eBooks · doi:10.1007/bfb0028987 · Cited by 40
Robustness of probabilistic computational complexity classes under definitional perturbations
Zachos, S. (1982) · Information and Control · doi:10.1016/s0019-9958(82)80019-3 · Cited by 37
Cited by
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Quantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 702
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Kabanets, V., & Impagliazzo, R. (2004) · computational complexity · doi:10.1007/s00037-004-0182-6 · Cited by 378
Arithmetic Circuits: A Survey of Recent Results and Open Questions
Shpilka, A., & Yehudayoff, A. (2010) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000039 · Cited by 363
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Metadata
- Authors
- Toda, S.
- Venue
- SIAM Journal on Computing
- Published
- 1991-10
- Volume
- 20
- Issue
- 5
- Pages
- 865-877
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2137407595
- Cited by
- 665
- References
- 21
- FWCI
- 14.65
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.