3 ms·
Are Wikipedia's explanations clear enough to you? Too long? Too formal or informal? https://en.wikipedia.org/wiki/P_versus_NP_problem https://en.wikipedia.org/w
by idupree 13y ago
Are Wikipedia's explanations clear enough to you? Too long? Too formal or informal?
https://en.wikipedia.org/wiki/P_versus_NP_problem https://en.wikipedia.org/wiki/P_versus_NP_problem
- orionblastar 13y agoThe Wikipedia article makes no sense to me. Please explain it in simple terms using your own words.
- qbrass 13y agohttp://simple.wikipedia.org/wiki/P%3DNP http://simple.wikipedia.org/wiki/P%3DNP Try that one.
- orionblastar 13y agoSorry clear as mud to me. I don't understand that one either.
- deleted 13y ago[deleted]
- alok-g 13y agoSeems like guessing a password would be an example. Assuming that the length of a password is N, if the machine can somehow guess the password, it can verify in O[N]. On the other hand, if the password is not known, the number of possible combinations to try would be exponential.