Np-hard Definition

adjective

(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.

Wiktionary

(computing theory) An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction.

Wiktionary

Nursing Abbreviations: From Job Titles to Medical Terminology
Basic Baseball Stats Abbreviations: An Essential Glossary
List of Commonly Used Abbreviations
Texting Slang
Examples of Skills: Job, Life, and Personal Skills
Powerful Examples of Empathy Statements

Words Near Np-hard in the Dictionary

np
n-pentane
np-easy
np-hard
npc
npd
npk
npl
npn
npo
npr