MathSciNet bibliographic data

MR1797272 (2001k:11265) 11Y16 (68W40) Weilert, André $(1+i)$-ary GCD computation in $Z[i]$ is an analogue to the binary GCD algorithm. J. Symbolic Comput. 30 (2000), no. 5, 605--617.

Article

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