As you may have noticed, above you will find words for "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.". Hover the mouse over the word you'd like to know more about to view its definition. Click to find a better fitting word. Finally, thanks to ChatGPT, the overall results have been greatly improved.