Question:

Which of the following problems is in P?

Show Hint

N/A
Updated On: May 3, 2025
  • Matrix multiplication
  • Graph isomorphism
  • Discrete logarithm
  • Knapsack problem
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

- Matrix multiplication: This problem is known to be in, as matrix multiplication can be solved in polynomial time with algorithms that have time complexities like \(O(n^3)\), which is polynomial.
- Graph isomorphism: This problem has not been proven to be in , and its classification is still an open question. It is in NP but not known to be solvable in polynomial time.
- Discrete logarithm: This problem is not solvable in polynomial time and is widely considered to be sub-exponential in difficulty. 
- Knapsack problem: The knapsack problem is NP-complete.
Therefore, the correct answer is 1. Matrix multiplication.

Was this answer helpful?
0
0