Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
patio11
on Aug 16, 2010
|
parent
|
context
|
favorite
| on:
P≠NP proof update
If P = NP then factoring numbers may be easy in such fashion that factoring numbers is not really that easy. N^749 is still polynomial time.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
