By "as easy as each other" I meant reducible to each other with a polynomial fac... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		sid0 on Jan 20, 2011 \| parent \| context \| favorite \| on: The polynomial algorithm for 3-SAT problem (or P=N... By "as easy as each other" I meant reducible to each other with a polynomial factor, as is standard in complexity theory.

eru on Jan 20, 2011 [–]

Yes, that why I prefaced with "To be pedantic". I just felt like pointing out that there are meaningful differences between polynomial problems.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact