Re:Did any processor implement an integer square root instru...
by klyrs on Sunday April 07, 2024 @01:32PM
(#39962276)
Subtle detail of complexity analysis: the input is of length log(n), so taking n^k steps for any positive number k is exponential time.
[ Parent
| on HN ]
There are no comments on this comment yet.