#computer-science

P vs. NP is the question of whether every problem whose solution can be verified quickly can also be solved quickly. P: problems solvable in polynomi…