Hacker News Reader

Are Wikipedia's explanations clear enough to you? Too long? Too formal or informal? https://en.wikipedia.org/wiki/P_versus_NP_problem

View on HN

The Wikipedia article makes no sense to me. Please explain it in simple terms using your own words.

http://simple.wikipedia.org/wiki/P%3DNP

Try that one.

Sorry clear as mud to me. I don't understand that one either.

Seems 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.

Reply on news.ycombinator.com