Ask Question
1 January, 00:22

Hi i was just wondering what is the P versus NP.

+4
Answers (2)
  1. 1 January, 02:54
    0
    In computational complexity theory, the complexity class NP complete in a class of problems having two properties it is in the set of NP problems any given solution to a problem can be verified quickly

    P is problem and NP is complete
  2. 1 January, 03:52
    0
    P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified by a computer, it can also be quickly solved by a computer
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “Hi i was just wondering what is the P versus NP. ...” in 📘 Mathematics if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers