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.
Posted 7 years ago by seekerland in category: interesting

No comments
Add comment as a guest or [ login ] to use your username