On the structure of polynomial time reducibility

Ladner, R. E. (1975). On the structure of polynomial time reducibility. ACM.

Type

Book chapter

Intellectual base

Review or monograph

Year

1975

DOI

10.1145/321864.321877

Link

https://doi.org/10.1145/321864.321877

Cited by

2 citations across 2 artifacts.

Domain-specific

• Computational complexity theory
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
• Padding argument
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:0ec3162c42cc · see in the full table