Essentially optimal sparse polynomial multiplication

DOI10.1145/3373207.3404026OpenAlexW3045630729WikidataQ131130492 ScholiaQ131130492MaRDI QIDQ5145974

Pascal Giorgi, Armelle Perret du Cray, Bruno Grenet

Publication date: 22 January 2021

Published in: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.11959

zbMATH Keywords

arithmeticprobabilistic verificationsparse interpolationsparse polynomial multiplication

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (2)

Removing additive structure in 3SUM-based reductions ⋮ Polynomial modular product verification and its implications

This page was built for publication: Essentially optimal sparse polynomial multiplication