NP-hard

Adjective

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

Modern English dictionary

Explore and search massive catalog of over 900,000 word meanings.

Word of the Day

Get a curated memorable word every day.

Challenge yourself

Level up your vocabulary by setting personal goals.

And much more

Try out Vedaist now.