NP-hard (English, adj)
expansion: NP-hard (not comparable)
Senses:
topics: computing
computing-theory
engineering
mathematics
natural-sciences
physical-sciences
sciences
glosses: A problem H is NP-hard if and only if there is an NP-complete problem L that is polynomial time Turing-reducible to H.
tags: not-comparable
topics: computing
computing-theory
engineering
mathematics
natural-sciences
physical-sciences
sciences
glosses: An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.
tags: not-comparable
Forms: