Computational Complexity

P versus NP

Status: Unsolved

The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly.

Children


Showing 1 to 3 of 3 results