Every np-complete problem reduces to the Halting problem. Is this true?

110 views Asked by At

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.

0

There are 0 answers