P≠NP予想
1. P versus NP problemThe 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 introduced in 1971 by Stephen Cook in his seminal paper "The complexity of theorem proving procedures" and is considered by many to be the most important open problem in the field.
Read “P versus NP problem” on English Wikipedia
Read “P≠NP予想” on Japanese Wikipedia
Read “P versus NP problem” on DBpedia
Read “P versus NP problem” on English Wikipedia
Read “P≠NP予想” on Japanese Wikipedia
Read “P versus NP problem” on DBpedia
Discussions
Log in to talk about this word.