The GATE Grind

GATE 2009 CS – Question 14

Theory of Computation · Turing Machines and Undecidability · 1 mark · Multiple choice

Let $\pi_A$ belong to NP. Which statement is TRUE?

  1. There is no polynomial-time algorithm for $\pi_A$.
  2. If $\pi_A$ can be solved deterministically in polynomial time, then P = NP.
  3. If $\pi_A$ is NP-hard, then it is NP-complete.
  4. $\pi_A$ may be undecidable.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) If $\pi_A$ is NP-hard, then it is NP-complete.

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Turing Machines and Undecidability questions

All Turing Machines and Undecidability questions →