The paper withdraws its exact dense matrix multiplication theorem due to a global obstruction in active-state realizations and introduces an unbiased conservative AMM estimator that computes protected low/marginal parts exactly while applying AMM only to the high/high residual.
Faster polynomial multiplication via multipoint Kronecker substitution
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on the performance of the standard Kronecker substitution by a sizeable constant, both in theory and in empirical tests.
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Graded Projection Recursion (GPR): Corrections, Obstructions, and Conservative Approximate Matrix Multiplication
The paper withdraws its exact dense matrix multiplication theorem due to a global obstruction in active-state realizations and introduces an unbiased conservative AMM estimator that computes protected low/marginal parts exactly while applying AMM only to the high/high residual.