Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
cvoss
on Aug 1, 2024
|
parent
|
context
|
favorite
| on:
Breakthrough a step toward revealing hidden struct...
Integer factorization is an NP problem but is not known to be NP-complete. Therefore, we do not know how to solve all NP problems in P time using a hypothetical P time factorization.
P =? NP would remain open.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
P =? NP would remain open.