Search found 1 match
Search found 1 match • Page 1 of 1
- Sat Sep 15, 2018 12:49 pm UTC
- Forum: Computer Science
- Topic: Formally, What is P and NP?
- Replies: 19
- Views: 8540
NP : if you have an answer to such a problem, you can “quickly” verify it P : if you have such a problem you can “quickly” solve it P = NP : if you have a way to navigate to any solutions that you can check you know you can solve them all. The importance is that there are no sneaky problems or excep...