Theory of Computation MCQ: Consider three problems P1, P2 and P3. It is known that P1 has polynomial time solution and P2 is NP-complete and P3 is in NP. Which one of the following is true. | Extra Education

← All Theory of Computation questions

1

Consider three problems P1, P2 and P3. It is known that P1 has polynomial time solution and P2 is NP-complete and P3 is in NP. Which one of the following is true.

Correct Answer: P3 is NP complete if P2 is reducible to P3

Make the most of this question

This page focuses on one Theory of Computation question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Theory of Computation MCQs All Engineering topics Mock test hub

WhatsApp+91 99922 70404Theory of Computation MCQ: Consider three problems P1, P2 and P3. It is known that P1 has polynomial time solution and P2 is NP-complete and P3 is in NP. Which one of the following is true. | Extra Education