The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the Structure of Polynomial Time Reducibility
Open accessAbstract
Two notions of polynomml time reduclbihty, denoted here by ~ T e and <.~P, were defined by Cook and Karp, respectively The abstract propertms of these two relatmns on the domain of computable sets are investigated.Both relations prove to be dense and to have minimal pairs.Further, there is a strictly ascending sequence with a minimal pair of upper bounds to the sequence.Our method of showing density ymlds the result that if P ~ NP then there are members of NP --P that are not polynomml complete KEY WORDS AND PHRASES polynomial time computation, Turing reduc~billty, many-one reducibility CR CATEGORIES 5 25
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 theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Cited by
A comparison of polynomial time reducibilities
Ladner, R. E., Lynch, N. A., & Selman, A. L. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90016-x · Cited by 408
Self-citationBennett, C. H., & Gill, J. (1981) · SIAM Journal on Computing · doi:10.1137/0210008 · Cited by 381
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Some NP-Complete Problems Similar to Graph Isomorphism
Lubiw, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210002 · Cited by 144
Metadata
- Authors
- Ladner, R. E.
- Venue
- Journal of the ACM
- Published
- 1975-01
- Volume
- 22
- Issue
- 1
- Pages
- 155-171
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2052936500
- Cited by
- 781
- References
- 1
- FWCI
- 11.09
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Structure of Polynomial Time Reducibility. https://app.cochat.ai/papers/10.1145/321864.321877
- The paper
- Ladner, R. E. (1975). On the Structure of Polynomial Time Reducibility. Journal of the ACM. https://doi.org/10.1145/321864.321877
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.
