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 |
Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
|
---|---|
Chapter number | 44 |
Book title |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
|
Published in |
ADS, January 2009
|
DOI | 10.1007/978-3-642-03685-9_44 |
Book ISBNs |
978-3-64-203684-2, 978-3-64-203685-9
|
Authors |
Adam R. Klivans, Philip M. Long, Alex K. Tang |
Mendeley readers
The data shown below were compiled from readership statistics for 11 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
France | 1 | 9% |
Unknown | 10 | 91% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 4 | 36% |
Student > Ph. D. Student | 3 | 27% |
Student > Master | 2 | 18% |
Student > Doctoral Student | 1 | 9% |
Other | 1 | 9% |
Other | 0 | 0% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 8 | 73% |
Agricultural and Biological Sciences | 1 | 9% |
Medicine and Dentistry | 1 | 9% |
Engineering | 1 | 9% |