The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
The complexity of combinatorial problems with succinct input representation
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
Stockmeyer, L. J. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90061-x · Cited by 1,293
Word problems requiring exponential time(Preliminary Report)
Stockmeyer, L. J., & Meyer, A. R. (1973) · Proceedings of the fifth annual ACM symposium on Theory of computing - STOC '73 · doi:10.1145/800125.804029 · Cited by 871
Computational Complexity of Probabilistic Turing Machines
Gill, J. (1977) · SIAM Journal on Computing · doi:10.1137/0206049 · Cited by 689
Separating the polynomial-time hierarchy by oracles
Yao, A. C.-C. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.49 · Cited by 548
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 circuit value problem is log space complete for P
Ladner, R. E. (1975) · ACM SIGACT News · doi:10.1145/990518.990519 · Cited by 306
Succinct representations of graphs
Galperin, H., & Wigderson, A. (1983) · Information and Control · doi:10.1016/s0019-9958(83)80004-7 · Cited by 217
BPP and the polynomial hierarchy
Lautemann, C. (1983) · Information Processing Letters · doi:10.1016/0020-0190(83)90044-3 · Cited by 212
Two remarks on the power of counting
Papadimitriou, C. H., & Zachos, S. K. (2006) · Springer eBooks · doi:10.1007/bfb0036487 · Cited by 209
Cited by
PP is as Hard as the Polynomial-Time Hierarchy
Toda, S. (1991) · SIAM Journal on Computing · doi:10.1137/0220053 · Cited by 665
Metadata
- Authors
- Wagner, K. W.
- Venue
- Acta Informatica
- Published
- 1986-06
- Volume
- 23
- Issue
- 3
- Pages
- 325-356
- ISSN
- 0001-5903 (ISSN-L)
- 1432-0525
- OpenAlex
- W2033323875
- Cited by
- 285
- References
- 20
- FWCI
- 2.86
- 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.