Basically prove/disprove a p-np problem can be solved(in polynomial time) then y... | Hacker News

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

SenorWilson on Dec 10, 2012 | parent | context | favorite | on: Jun Fukuyama's P≠NP Page

Basically prove/disprove a p-np problem can be solved(in polynomial time) then you've proved it for the rest of the p-np problems.

emillon on Dec 10, 2012 [–]

I think that you mean a NP-complete problem. There's no such thing as a "p-np problem".

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