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 Hardness of Learning with Rounding over Small Modulus
|
---|---|
Chapter number | 9 |
Book title |
Theory of Cryptography
|
Published in |
Lecture notes in computer science, December 2015
|
DOI | 10.1007/978-3-662-49096-9_9 |
Book ISBNs |
978-3-66-249095-2, 978-3-66-249096-9
|
Authors |
Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen |
Editors |
Eyal Kushilevitz, Tal Malkin |
Mendeley readers
The data shown below were compiled from readership statistics for 50 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 50 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 16 | 32% |
Student > Master | 9 | 18% |
Researcher | 6 | 12% |
Professor > Associate Professor | 3 | 6% |
Lecturer | 2 | 4% |
Other | 6 | 12% |
Unknown | 8 | 16% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 30 | 60% |
Mathematics | 4 | 8% |
Physics and Astronomy | 2 | 4% |
Social Sciences | 1 | 2% |
Engineering | 1 | 2% |
Other | 1 | 2% |
Unknown | 11 | 22% |