Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on The polynomial algorithm for 3-SAT problem (or P=NP). Parent comment
a. P is in NP, and
b. Every problem in NP can be converted to an instance of P.
Consider any two problems in NPC, P and Q. Then each is in NP, and each can be converted to the other. They are therefore equivalent.
QED.
There are no comments on this comment yet.
a. P is in NP, and
b. Every problem in NP can be converted to an instance of P.
Consider any two problems in NPC, P and Q. Then each is in NP, and each can be converted to the other. They are therefore equivalent.
QED.