Flip Graphs for Polynomial Multiplication
Shaoshi Chen, Manuel Kauers
TL;DR
This paper investigates the application of flip graphs, a technique originally used for matrix multiplication, to improve polynomial multiplication methods, exploring its effectiveness and potential benefits.
Contribution
It extends the use of flip graphs from matrix multiplication to polynomial multiplication, providing new insights and potential methods for more efficient polynomial computations.
Findings
Flip graphs can be applied to polynomial multiplication.
Preliminary results suggest potential efficiency gains.
The approach opens new avenues for tensor-based polynomial algorithms.
Abstract
Flip graphs were recently introduced in order to discover new matrix multiplication methods for matrix sizes. The technique applies to other tensors as well. In this paper, we explore how it performs for polynomial multiplication.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Commutative Algebra and Its Applications · Cryptography and Residue Arithmetic