Aspects


vs


Np-complete

NP-Complete refers to the hardest known problems within the complexity class NP

Np-hard

NP-hard problems (Non-deterministic Polynomial-time hard problems) are those problems which are not easier than any problem in NP; in other words, an algorithm for an NP-hard problem can be used to solve any problem in NP by transforming the input in polynomial time