P vs. NP and the Computational Complexity Zoo The P versus NP problem is a major unsolved problem in computer science. Informally speaking, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. Facebook Prev Article Next Article Discover Checkout these cool gadgets... Related Posts Why Does My Body Do That !? How do we separate the seemingly inseparable? The Real Meaning of E=mc² How Plants Could Power The Future Why Scientists Used Graphene Nanoribbons to Engineer Bionic Mushrooms Were the Pyramids Build in Water?