Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Classic Nintendo Games Are NP-Hard (2012). Parent comment
Which is exactly what quantum computers can do for certain classes of problems, such as integer factorization.
Sadly, it seems not to be the case (or not yet found?) for the most well known and useful class of NP problems, NP-complete.
See this discussion https://news.ycombinator.com/item?id=1371150
There are no comments on this comment yet.
Which is exactly what quantum computers can do for certain classes of problems, such as integer factorization.
Sadly, it seems not to be the case (or not yet found?) for the most well known and useful class of NP problems, NP-complete.
See this discussion https://news.ycombinator.com/item?id=1371150