Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
jsprogrammer
on July 22, 2015
|
parent
|
context
|
favorite
| on:
A Polynomial Time Bounded-Error Quantum Algorithm ...
>any NP problem can be polynomially reduced to an NP-hard problem
Except that there is some probability that the algorithm will be unable to solve the problem?
eru
on July 30, 2015
[–]
Success/Failure would be independent between runs. Ie if you fail, you just run again.
Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
Except that there is some probability that the algorithm will be unable to solve the problem?