Efficient Generic Quotients Using Exact Arithmetic

DOI10.1145/3597066.3597076arXiv2304.01753OpenAlexW4383213546WikidataQ131124327 ScholiaQ131124327MaRDI QIDQ6081979

Stephen M. Watt

Publication date: 3 November 2023

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

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

zbMATH Keywords

remaindergeneric algorithmsquotientmodified Newton iterationpolynomial arithmeticInteger arithmeticlibrary structure

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast multiplication of large numbers
• Integer multiplication in time \(O(n\log n)\)
• Modern Computer Algebra
• Integer division in residue number systems
• Lower Bounds for Multiplication via Network Coding
• Fast in-place algorithms for polynomial operations

This page was built for publication: Efficient Generic Quotients Using Exact Arithmetic