On the complexity of the extended Euclidean algorithm

Havas, G. (2003). On the complexity of the extended Euclidean algorithm. In: J. Harland, Computing: The Australasian Theory Symposium, Electronic Notes in Theoretical Computer Science. Computing: The Australasian Theory Symposium, Electronic Notes in Theoretical Computer Science, Adelaide, (1-4). 4-7 February, 2003.

Author Havas, G.
Title of paper On the complexity of the extended Euclidean algorithm
Conference name Computing: The Australasian Theory Symposium, Electronic Notes in Theoretical Computer Science
Conference location Adelaide
Conference dates 4-7 February, 2003
Proceedings title Computing: The Australasian Theory Symposium, Electronic Notes in Theoretical Computer Science
Place of Publication The Netherlands
Publisher Elsevier
Publication Year 2003
Sub-type Fully published paper
Editor J. Harland
Volume 78
Start page 1
End page 4
Total pages 4
Collection year 2003
Subjects EX
280405 Discrete Mathematics
780101 Mathematical sciences
Q-Index Code EX

 
Versions
Version Filter Type
Citation counts: Google Scholar Search Google Scholar
Created: Fri, 24 Aug 2007, 02:23:31 EST