4 ms·
I don't believe this. If this were true, it would imply that the decision version of the integer factorization problem is not NP-complete. That sounds too good
by sanxiyn 16y ago
I don't believe this. If this were true, it would imply that the decision version of the integer factorization problem is not NP-complete. That sounds too good to be true.
- sirclueless 16y agoAs far as I can tell, D-Wave's adiabatic quantum computer has never demonstrated polynomial-time factoring either. The result mentioned in ars technica (DOI link is down, and a scholar search didn't find it) might also invalidate the use of said computer for this purpose.