Re:Factoring may be easier than we think (2016)
by nabla9 on Sunday June 30, 2019 @12:54PM
(#20319108)
Grover's algorithm still takes exponentially many operations to solve a search problem that can be brute-forced in exponentially many steps. Much faster, but still in EXPTIME. No jump from exponential to polynomial complexity class.
[ Parent
| on HN ]
There are no comments on this comment yet.