Advanced
Data Structures & Algorithms
Q86 / 100
What does the P vs NP problem ask?
Correct! Well done.
Incorrect.
The correct answer is B) Whether every problem whose solution can be verified in polynomial time can also be solved in polynomial time
B
Correct Answer
Whether every problem whose solution can be verified in polynomial time can also be solved in polynomial time
Explanation
P is the class of problems solvable in polynomial time. NP is the class verifiable in polynomial time. The open question is whether P = NP. Most believe P ≠ NP.
Progress
86/100