scientific article; zbMATH DE number 1156678

MaRDI QIDQ4390717zbMATH OpenFDO

Authors George Havas, Bohdan S. Majewski

Publication date 26 May 1998

zbMATH Keywords

extended gcd problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1254257
• scientific article; zbMATH DE number 1405690
• Computing GCD's by normalized division
• Publication:4941893
• scientific article; zbMATH DE number 1253972
• scientific article; zbMATH DE number 3995051
• An extended Jebelean-Weber-Sedjelmaci GCD algorithm
• scientific article; zbMATH DE number 1113834
• Extending the binary gcd algorithms

Cited in

(6)

• How to Remove the Exponent GCD in HK09
• scientific article; zbMATH DE number 1254257 (Why is no real title available?)
• scientific article; zbMATH DE number 1113834 (Why is no real title available?)
• scientific article; zbMATH DE number 799777 (Why is no real title available?)
• scientific article; zbMATH DE number 1418331 (Why is no real title available?)
• Saturation of finitely-generated submodules of free modules over Prüfer domains

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 Q4390717)