|
|
||
|
|
|
MR1339115
(96h:11128)
11Y16
Jebelean, Tudor A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers. Design and implementation of symbolic computation systems (Gmunden, 1993). J. Symbolic Comput. 19 (1995), no. 1-3, 145--157. |
|
|
| 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. | ||||
|
|
||||
AMS Home Page
|