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 Lattice Problems with Polynomial Approximation Factors
|
|---|---|
| Chapter number | 15 |
| Book title |
The LLL Algorithm
|
| Published by |
Springer, Berlin, Heidelberg, January 2009
|
| DOI | 10.1007/978-3-642-02295-1_15 |
| Book ISBNs |
978-3-64-202294-4, 978-3-64-202295-1
|
| Authors |
Oded Regev |
Mendeley readers
The data shown below were compiled from readership statistics for 35 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| United States | 1 | 3% |
| Brazil | 1 | 3% |
| Unknown | 33 | 94% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 12 | 34% |
| Student > Master | 5 | 14% |
| Researcher | 5 | 14% |
| Professor > Associate Professor | 3 | 9% |
| Student > Bachelor | 2 | 6% |
| Other | 5 | 14% |
| Unknown | 3 | 9% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 28 | 80% |
| Mathematics | 3 | 9% |
| Physics and Astronomy | 1 | 3% |
| Unknown | 3 | 9% |