scientific article; zbMATH DE number 3846865
[For the entire collection see Zbl 0491.00019.] In this work efficient algorithms for performing various arithmetic operations on basic algebraic domains are described. The operations include addition, multiplication, exponentiation, division, and gcd calculation; the domains considered are the rational integers, the rational numbers, the integers modulo m, the Gaussian integers, polynomials, rational functions, power series, finite fields, and p-adic numbers. The authors also furnish bounds on the maximum, minimum, and average computing time needed to execute the various algorithms which they discuss.
- Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
- The complexity of number-theoretic constants
- Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
- scientific article; zbMATH DE number 3920595 (Why is no real title available?)
- scientific article; zbMATH DE number 6948260 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3316586)