Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
qdog
on Dec 11, 2012
|
parent
|
context
|
favorite
| on:
Jun Fukuyama's P≠NP Page
All NP problems can be converted into the other NP problems, therefore if you can prove it for one NP problem, you prove it for all NP problems.
cgray4
on Dec 11, 2012
[–]
You missed a few words. Any NP-complete problem can be converted into any other NP-complete problem in polynomial time.
qdog
on Dec 11, 2012
|
parent
[–]
Right, oops.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
