Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
sylware
on May 13, 2022
|
parent
|
context
|
favorite
| on:
Computer Scientists Prove That Certain Problems Ar...
Isn't this the type of problem a "quantum" computer with enough qbits could solve extremely quickly?
LeegleechN
on May 13, 2022
[–]
No, they can solve integer factoring. This result shows that polynomial factoring is fundamentally different from integer factoring. The latter is believed to not be NP Hard.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
