Re:Factoring may be easier than we think (2016)
by seppel on Monday July 01, 2019 @07:48PM
(#20330844)
I agree in principle. But I disagree that you cannot test GNFS on small numbers. You can do this, but you are right that you might have trouble to easily verify that it has a better asymtotic complexity than other algorithms.
[ Parent
| on HN ]
There are no comments on this comment yet.