Suppose that a problem A is known to have a polynomial-time verification algorithm. Which of the following statements can be deduced.

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation

Q. Suppose that a problem A is known to have a polynomial-time verification algorithm. Which of the following statements can be deduced.

(A) A is in NP.
(B) A is in NP but not P
(C) A is in both NP and P.
(D) A is NP-complete.

💬 Discuss

✅ Correct Answer: (B) A is in NP but not P

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

646

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate