|
|
We do not currently know of any synonyms for NP-hard.
The adjective NP-hard is defined as:
- 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.
See full definition of the word NP-hard.
|
|
|
|
|
|
|
|
|