Lazy and Forgetful Polynomial Arithmetic and Applications

DOI10.1007/978-3-642-04103-7_20zbMath1260.68483OpenAlexW1559434209MaRDI QIDQ3644102

Paul Vrbik, Michael B. Monagan

Publication date: 10 November 2009

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04103-7_20

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)

Related Items

On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation

Uses Software

• IBM Scratchpad

Cites Work

• Unnamed Item
• Unnamed Item
• Sparse polynomial division using a heap
• Relax, but don't be too lazy
• Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
• Infinite structures in scratchpad II
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination