Asymptotically Fast GCD Computation in ℤ[i]

Lecture Notes in Computer Science - Algorithmic Number Theory ◽

10.1007/10722028_40 ◽

2000 ◽

pp. 595-613 ◽

Cited By ~ 6

Author(s):

André Weilert

Download Full-text