News for hackers. Stuff that matters.
Re:Moore’s Law won’t kill passwords by tiziano88 on Friday January 18, 2013 @08:17AM (#5078459)
I did mean subset, apparently a quantum computer could not solve every NP-complete problem in polynomial time. factorisation seems to be one of the candidates to benefit from quantum computation (thanks to Shor's algorithm), but SAT (for instance) would not, at least based on current state-of-art
Re:Moore’s Law won’t kill passwords by eru on Friday January 18, 2013 @10:14AM (#5078987)
Yes, I know.

So I guess if you meant subset, then you didn't mean to write "quantum ___non-deterministic___ Turing machine in P-time"?