Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Np-Completeness - What is the difference between NP-hard and NP-complete?


There is no efficient method that can solve NP-hard problems in polynomial time; in other words, they are as tough, if not more so, as the hardest problems in NP. As an alternative, questions that are NP-complete (a subset of NP-hard) can be proved in polynomial time.