if A be an NP-complete problem, and if B be an NP-hard problem. If A is polynomial time solvable then is B is polynomial time solvable?
on the contrary, if A be an NP-complete problem, and B be an NP-hard problem. If A is polynomial time solvable then is B is polynomial time solvable?
My intuition is, (which may be very wrong), for (1) there are some problems, which are not in NP but are still NP Hard. In that case, wouldn't that make the first statement false? Since a basic requirement for a problem to be in NPC is that the problem should belong to NP Hard first.