A New Algorithm and Refined Bounds for Extended Gcd Computation

Authors:
David Ford;George Havas
Affiliations:
-;-
Venue:
ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory
Year:
1996

Citing 0
Cited 2

On the worst-case complexity of integer Gaussian elimination

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Complete functional synthesis

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract