MathSciNet bibliographic data

MR1850636 (2002k:11226) 11Y16 (11A05 11A15 11R11) Weilert, André Asymptotically fast GCD computation in $\Bbb Z[i]$. Algorithmic number theory (Leiden, 2000), 595--613, Lecture Notes in Comput. Sci., 1838, Springer, Berlin, 2000.

Links to the journal or article are not yet available

For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page American Mathematical Society 201 Charles Street Providence, RI 02904-6248 USA © Copyright 2009, American Mathematical Society Privacy Statement