On the complexity of the extended Euclidean algorithm (extended abstract)

MaRDI QIDQ2843908zbMATH OpenFDO

Authors George Havas

Publication date 27 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104810028

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Euclid's algorithm, Guass' elimination and Buchberger's algorithm
• A Greatest Common Divisor Algorithm
• Fast computation of GCDs
• scientific article; zbMATH DE number 799777
• scientific article; zbMATH DE number 1254258

Cited in

(12)

• Partial evaluation of the Euclidean algorithm, revisited
• Fine costs for Euclid's algorithm on polynomials and Farey maps
• Extended Euclidean algorithm and CRT algorithm
• scientific article; zbMATH DE number 6533440 (Why is no real title available?)
• scientific article; zbMATH DE number 65249 (Why is no real title available?)
• A suite of algorithms for key distribution and authentication in centralized secure multicast environments
• scientific article; zbMATH DE number 1254272 (Why is no real title available?)
• Euclid's algorithm, Guass' elimination and Buchberger's algorithm
• scientific article; zbMATH DE number 841638 (Why is no real title available?)
• scientific article; zbMATH DE number 910709 (Why is no real title available?)
• scientific article; zbMATH DE number 7368168 (Why is no real title available?)
• scientific article; zbMATH DE number 7119801 (Why is no real title available?)

This page was built for publication: On the complexity of the extended Euclidean algorithm (extended abstract)

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