Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication

DOI10.1145/2755996.2756653zbMath1346.68266arXiv1501.05296OpenAlexW1969941659MaRDI QIDQ2819733

Daniel S. Roche, Andrew Arnold

Publication date: 29 September 2016

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

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

zbMATH Keywords

computational complexitysumsetMinkowski sumpolynomial multiplicationsparse interpolation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Randomized algorithms (68W20)

Related Items (4)

Sparse polynomial interpolation based on derivatives ⋮ Multilinear polynomial systems: root isolation and bit complexity ⋮ Polynomial modular product verification and its implications ⋮ Sparse polynomials in FLINT

This page was built for publication: Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication