You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
The complexity of greatest common divisor computations
|
---|---|
Chapter number | 56 |
Book title |
Algorithmic Number Theory
|
Published by |
Springer Berlin Heidelberg, January 1994
|
DOI | 10.1007/3-540-58691-1_56 |
Book ISBNs |
978-3-54-058691-3, 978-3-54-049044-9
|
Authors |
Bohdan S. Majewski, George Havas |
Editors |
Leonard M. Adleman, Ming-Deh Huang |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
India | 1 | 25% |
Unknown | 3 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 25% |
Professor > Associate Professor | 1 | 25% |
Student > Master | 1 | 25% |
Unknown | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 50% |
Mathematics | 1 | 25% |
Unknown | 1 | 25% |