+"P Versus Np" is a central, unsolved problem in [Computer Science](/wiki/computer_science), asking if every problem whose solution can be quickly verified can also be quickly solved. This profound question explores the fundamental limits of efficient computation and the nature of [Algorithm](/wiki/algorithm) design. Its resolution would drastically alter our understanding of what machines can achieve.
+## See also
+- [Complexity Class](/wiki/complexity_class)
+- [Computational Complexity](/wiki/computational_complexity)
+- [Turing Machine](/wiki/turing_machine)
... 1 more lines