Ask Question
22 December, 21:51

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

+5
Answers (2)
  1. 22 December, 22:11
    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. 22 December, 22:13
    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 the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers