News for hackers. Stuff that matters.

A comment on The polynomial algorithm for 3-SAT problem (or P=NP). Parent comment

Re:The polynomial algorithm for 3-SAT problem (or P=NP) by sid0 on Thursday January 20, 2011 @12:46PM (#2124471)
By "as easy as each other" I meant reducible to each other with a polynomial factor, as is standard in complexity theory.
[ Parent | on HN ]
Re:The polynomial algorithm for 3-SAT problem (or P=NP) by eru on Thursday January 20, 2011 @01:05PM (#2124566)
Yes, that why I prefaced with "To be pedantic". I just felt like pointing out that there are meaningful differences between polynomial problems.
[ Parent | on HN ]