Over large fields, flip graphs connect the naive polynomial multiplication algorithm to an optimal Toom-Cook algorithm in a cubic number of flips and reductions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Flip Graphs for Polynomial Multiplication
Over large fields, flip graphs connect the naive polynomial multiplication algorithm to an optimal Toom-Cook algorithm in a cubic number of flips and reductions.