Construct · 1 fields · 1 citations

polynomial-time reduction: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Theory of computation

a polynomial-time transformation of instances of one problem into instances of another that preserves yes answers, used to compare problem difficulty.

In theory of computation, polynomial-time reduction refers to a polynomial-time transformation of instances of one problem into instances of another that preserves yes answers, used to compare problem difficulty. This meaning comes from Karp (1972) in Complexity of Computer Computations.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how polynomial-time reduction sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

NP-completeness1 fields · 3 citationsanchor · a standalone construct reduction5 fields · 5 citationsjingle · one word, five constructs hardness4 fields · 4 citationsjingle · one word, four constructs

References

Karp, R. M. (1972). Reducibility among Combinatorial Problems. In Complexity of Computer Computations (pp. 85-103). Springer US. https://doi.org/10.1007/978-1-4684-2001-2_9

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct