4 ms·
http://simple.wikipedia.org/wiki/P%3DNP http://simple.wikipedia.org/wiki/P%3DNP Try that one.
by qbrass 14y ago
http://simple.wikipedia.org/wiki/P%3DNP http://simple.wikipedia.org/wiki/P%3DNP
Try that one.
- orionblastar 14y agoSorry clear as mud to me. I don't understand that one either.
- deleted 14y ago[deleted]
- alok-g 14y 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.