1 paper · 1 filter
Igor Nesiolovskiy, Artem Nesiolovskiy
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3…