pith. sign in

arxiv: 0712.4046 · v1 · submitted 2007-12-25 · 💻 cs.SC · cs.DS

Faster polynomial multiplication via multipoint Kronecker substitution

David Harvey This is my paper
classification 💻 cs.SC cs.DS
keywords kroneckersubstitutionalgorithmsmultiplicationpolynomialconstantdenseempirical
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Graded Projection Recursion (GPR): Corrections, Obstructions, and Conservative Approximate Matrix Multiplication

    cs.CC 2025-11 conditional novelty 4.0

    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 par...