Description : Can anyone explain what NP-hard means?
Last Answer : answer:From your link on Wiki for NP-hard : NP-hardness (non-deterministic polynomial-time hard), in computational complexity theory, is a class of problems that are, informally, at least as ... been proven. Moreover, the class NP also contains all problems which can be solved in polynomial time.