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

Question

asked Feb 26, 2018 49.6k views

2 Answers

Waterfr Villa · Answer 1 · 2018-02-27T15:07:01+0000

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

Robaticus · Answer 2 · 2018-03-04T22:20:09+0000

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

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

Please log in or register to add a comment.

Please log in or register to answer this question.

2 Answers

Please log in or register to add a comment.

Please log in or register to add a comment.

No related questions found

Categories

Other Questions