# NP-hard

Jump to navigation
Jump to search

## English[edit]

### Adjective[edit]

**NP-hard** (*not comparable*)

- (computing theory) 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.
- (computing theory) An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.