Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
anorwell
on Jan 20, 2011
|
parent
|
context
|
favorite
| on:
The polynomial algorithm for 3-SAT problem (or P=N...
If a single NP-Complete problem is in P, then P=NP. This is what NP-Complete means. In particular, factoring would be in P. Conversely, factoring is not NP-complete, so if factoring were in P, we could not draw any conclusions about P=?NP.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: