"The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. It was essentially first mentioned in a 1956 letter written by Kurt G\u00F6del to John von Neumann. G\u00F6del asked whether a certain NP-complete problem could be solved in quadratic or linear time."@en . . . .