np-hard

N n

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definitions of np-hard word

noun Technical meaning of np-hard (complexity) A set or property of computational search problems. A problem is NP-hard if solving it in polynomial time would make it possible to solve all problems in class NP in polynomial time. Some NP-hard problems are also in NP (these are called "NP-complete"), some are not. If you could reduce an NP problem to an NP-hard problem and then solve it in polynomial time, you could solve all NP problems. See also computational complexity. 1
adjective np-hard (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. 0
adjective np-hard (computing theory) An alternative definition restricts NP-hard to decision problems and then uses polynomial-time many-one reduction instead of Turing reduction. 0

See all 3 definitions of np-hard

Information block about the term

Parts of speech for Np-hard

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Np-hard

See also

All definitions of np-hard

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?