What Can (and Can't) we Do with Sparse Polynomials?

DOI10.1145/3208976.3209027zbMath1467.12003arXiv1807.08289OpenAlexW3102065507MaRDI QIDQ5120174

Daniel S. Roche

Publication date: 9 September 2020

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

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

zbMATH Keywords

interpolationarithmeticfactorizationsparse polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational methods for problems pertaining to field theory (12-08)

Related Items (8)

Implementing the Tangent Graeffe Root Finding Method ⋮ A New Black Box Factorization Algorithm - the Non-monic Case ⋮ Factoring multivariate polynomials represented by black boxes: a Maple + C implementation ⋮ Methodologies of Symbolic Computation ⋮ Termination of polynomial loops ⋮ Fast amortized multi-point evaluation ⋮ Amortized multi-point evaluation of multivariate polynomials ⋮ Polynomial modular product verification and its implications

This page was built for publication: What Can (and Can't) we Do with Sparse Polynomials?