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 |
On the Complexity of Computing Prime Tables
|
|---|---|
| Chapter number | 57 |
| Book title |
Algorithms and Computation
|
| Published by |
Springer, Berlin, Heidelberg, December 2015
|
| DOI | 10.1007/978-3-662-48971-0_57 |
| Book ISBNs |
978-3-66-248970-3, 978-3-66-248971-0
|
| Authors |
Martín Farach-Colton, Meng-Tsung Tsai, Farach-Colton, Martín, Tsai, Meng-Tsung |
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 5 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Bachelor | 1 | 20% |
| Student > Master | 1 | 20% |
| Unknown | 3 | 60% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 2 | 40% |
| Unknown | 3 | 60% |