ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION

DOI10.1142/9789812799661_0008MaRDI QIDQ4550791zbMATH OpenOpenAlexFDO

Authors Kai Li, Lihong Zhi, M.-T. Noda

Publication date 4 September 2002

Published in Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789812799661_0008

zbMATH Keywords

Hensel liftingMaple packageMatlab packagemultivariate polynomial GCD computationproblem solving environments

Mathematics Subject Classification ID

Computational methods for problems pertaining to field theory (12-08) Symbolic computation and algebraic computation (68W30)

Recommendations

• A Paper-and-Pencil gcd Algorithm for Gaussian Integers
• scientific article; zbMATH DE number 1113834
• A systolic algorithm for extended GCD computation
• On a parallel Lehmer-Euclid GCD algorithm
• Fast computation of GCDs
• Computation of approximate polynomial GCDs and an extension
• An approximating k-ary GCD algorithm
• Parallel computation of polynomial GCD and some related parallel computations over abstract fields
• GCD calculation in the search task of pseudoprime and strong pseudoprime numbers

Cited in

(2)

• scientific article; zbMATH DE number 1262426 (Why is no real title available?)
• scientific article; zbMATH DE number 1538926 (Why is no real title available?)

Describes a project that uses

Uses Software

• Maple
• Matlab

This page was built for publication: ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION

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