In computer science, NP refers to problems where a solution can be verified quickly, even if finding that solution may take enormous time. This class has guided much of modern complexity theory. Its ...