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?

Question

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.

There seems to be a mixup in part 2? Should you swap A and B in the final sentence? — Pål GD, Dec 08 '21 at 09:06
Does this answer your question? What is the definition of P, NP, NP-complete and NP-hard? — Pål GD, Dec 08 '21 at 10:09
@PålGD Thanks for answering. The part 2 is as is. My intuition behind it, is that since npc is already required to be an NP hard problem, then if A is polynomial time solvable(PTS) then B will also be PTS? — Joe, Dec 08 '21 at 15:03

score 1 · Answer 1 · answered Dec 08 '21 at 09:07

When you hear B is NP-hard, you can consider B being undecidable. If P = NP, then B is still undecidable.

If A is NP-complete and B is NP-hard, and B polynomial time solvable, then, yes, recall:

if X is NP-hard, then for every problem Y in NP, there exists a polynomial time reduction from Y to X.

It follows that then A must be polynomial time solvable too.

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?

1 Answers1