Improved Division by Invariant Integers

DOI10.1109/TC.2010.143MaRDI QIDQ5280622zbMATH OpenWikidataFDO

Authors

Publication date 27 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2010.143

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited in

(7)

• A fast parallel sparse polynomial GCD algorithm
• An interpolation algorithm for computing Dixon resultants
• Faster arithmetic for number-theoretic transforms
• WhyMP, a formally verified arbitrary-precision integer library
• IMPROVING AN INEQUALITY FOR THE DIVISOR FUNCTION
• A Why3 proof of GMP algorithms
• libwignernj: a reusable C/C++/Fortran/Python library for exact Wigner symbols and related coefficients

This page was built for publication: Improved Division by Invariant Integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280622)