The P vs. NP problem is considered the most central problem in theoretical computer science, combinatorial algorithm theory, and computational complexity theory. The problem asks if P is equal to NP and it is still unsolved.