---
title: P vs. NP and the Computational Complexity Zoo — HIGH T3CH
url: https://hight3ch.com/p-vs-np-and-the-computational-complexity-zoo/
date: 2016-05-16
---

# 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.