KnowraPolynomial-time reductionLinked fromLinked fromThe 16 pages that link to Polynomial-time reduction, each with the reason it gives.All 16Broader topic 3Related 12Narrower topic 1NP-completenessBroader topic: These reductions formalize the claim that every NP problem is no harder than a given one.Many-one reductionBroader topic: A time bound makes the mapping useful for comparing computational efficiency.NP-hardnessBroader topic: NP-hardness is defined by reductions; their precise kind determines which problems qualify.