+P versus NP is a central unsolved problem in [computer science](/wiki/computer_science) and [mathematics](/wiki/mathematics). It asks whether every problem whose solution can be quickly verified can also be quickly found. Its resolution carries a million-dollar prize and could profoundly reshape our understanding of computation.
+## See also
+- [Complexity Class](/wiki/complexity_class)
+- [Algorithm](/wiki/algorithm)
+- [Turing Machine](/wiki/turing_machine)
... 1 more lines