Pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

math.NT 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Algorithms for the Multiplication Table Problem

math.NT · 2019-08-12 · conditional · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Algorithms for the Multiplication Table Problem math.NT · 2019-08-12 · conditional · none · ref 2

    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.