1

I guess that every np-complete problem reduces to the np-hard problem, so the given statement is true. But don't know how to prove it.

Matt Timmermans
  • 53,709
  • 3
  • 46
  • 87
Romil
  • 55
  • 3
  • 1
    Halting problem is not NP-hard. It is unsolvable. – user58697 Jul 29 '20 at 18:53
  • Every problem in NP reduces to every NP-hard problem, and a problem is NP-complete if it's in NP and it's NP-hard. You don't prove those things. Those are the *definitions* of NP-complete and NP-hard. You *could* reduce every NP-complete problem to halting, but why? – Matt Timmermans Jul 29 '20 at 19:51

0 Answers0