🤖 AI Summary
This work addresses the computational efficiency of polynomial multiplication. We introduce, for the first time, flip graph techniques—previously applied to matrix multiplication—to the tensor modeling of polynomial multiplication. Our method proposes a unified search framework integrating tensor decomposition, combinatorial optimization, and geometric flip graph construction to systematically explore low-rank decompositions of the polynomial multiplication tensor. The approach discovers novel polynomial multiplication algorithms achieving asymptotic complexity $O(n^{log_2 3 - varepsilon})$ for degrees $n in [8,64]$, outperforming the classical Karatsuba algorithm; the best variant reduces the number of required scalar multiplications from seven to six, thereby breaking the conventional divide-and-conquer lower bound. This work establishes a new application paradigm for flip graphs in algebraic computation tensors and provides a scalable, geometrically grounded pathway for designing efficient higher-order algebraic 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.