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

zbMATH Open1270.11130MaRDI QIDQ2843908

George Havas

Publication date: 27 August 2013

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

Mathematics Subject Classification ID

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

Related Items (5)

Partial evaluation of the Euclidean algorithm, revisited ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Fine costs for Euclid's algorithm on polynomials and Farey maps ⋮ Title not available (Why is that?)

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)