On the complexity of the extended euclidean algorithm (Extended Abstract)
Author:
Open Access
- 30 April 2003
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 78, 1-4
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Complexity of the Havas, Majewski, Matthews LLL Hermite Normal Form AlgorithmJournal of Symbolic Computation, 2000
- The Complexity of the Extended GCD Problem1999
- Extended GCD and Hermite Normal Form Algorithms via Lattice Basis ReductionExperimental Mathematics, 1998
- Integer Matrix DiagonalizationJournal of Symbolic Computation, 1997
- A new algorithm and refined bounds for extended gcd computationLecture Notes in Computer Science, 1996
- A hard problem that is almost always easy1995
- The complexity of greatest common divisor computationsLecture Notes in Computer Science, 1994
- Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer MatrixSIAM Journal on Computing, 1989
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982