Re:P versus NP Explained
by pdpi on Monday February 03, 2014 @03:05PM
(#7173096)
Algorithmic complexity is predicated on what sort of computational model you're working on top of. For the most part, that means "Deterministic Turing Machines", but that's not the only sort of computing machine out there. E.g. quantum computers can solve a whole class of NP problems (like factorisation) in poly time.
[ Parent
| on HN ]
There are no comments on this comment yet.