M

Mr. Dubey • 100.69K Points
Coach

Q. 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.

  • (A) P3 has polynomial time solution if P1 is polynomial time reducible to P3
  • (B) P3 is NP complete if P3 is polynomial time reducible to P2
  • (C) P3 is NP complete if P2 is reducible to P3
  • (D) P3 has polynomial time complexity and P3 is reducible to P2
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. A measure of goodness of fit for the estimated regression equation is the

Q. The polarization of plane waves received from satellite is changed by

Q. The negation of the statement is formed by introducing ___________.

Q. CPU speed of a personal computer is

Q. Which of the following is the largest unit?

Q. In transport layer, Multiplexing is done at

Q. Linear SVMs have no hyperparameters that need to be set by cross-validation

Q. All-to-all personalized communication is also known as .

Q. Graph used to represent semantic network is _____________

Q. What will be the output of the following Python code? 1. >>>str1="helloworld" 2. >>>str1[::-1]

Question analytics