A claimed subquadratic tabulation algorithm for M(n) with time O(n^2 / L^{1/sqrt(2)+o(1)}), plus exact tables to 2^30 and Monte Carlo tables to 2^100,000,000, with an incomplete proof of the main complexity bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Algorithms for the Multiplication Table Problem
A claimed subquadratic tabulation algorithm for M(n) with time O(n^2 / L^{1/sqrt(2)+o(1)}), plus exact tables to 2^30 and Monte Carlo tables to 2^100,000,000, with an incomplete proof of the main complexity bound.