Nearly Optimal Sparse Polynomial Multiplication

DOI10.1109/TIT.2020.2989385zbMath1453.68224arXiv1901.09355OpenAlexW3018936433WikidataQ114084347 ScholiaQ114084347MaRDI QIDQ5138887

Vasileios Nakos

Publication date: 4 December 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (3)

Bit-twiddling hacks for gamma matrices ⋮ Removing additive structure in 3SUM-based reductions ⋮ Polynomial modular product verification and its implications

This page was built for publication: Nearly Optimal Sparse Polynomial Multiplication