Computing Sparse Multiples of Polynomials

DOI10.1007/978-3-642-17517-6_25zbMath1310.68107arXiv1009.3214OpenAlexW1503393710MaRDI QIDQ3060739

Hrushikesh Tilak, Daniel S. Roche, Mark W. Giesbrecht

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in number theory (11C08)

Related Items (2)

Computing sparse multiples of polynomials ⋮ No short polynomials vanish on bounded rank matrices

This page was built for publication: Computing Sparse Multiples of Polynomials