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 |
Limitations of Hardness vs. Randomness under Uniform Reductions
|
---|---|
Chapter number | 37 |
Book title |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
|
Published by |
Springer, Berlin, Heidelberg, January 2008
|
DOI | 10.1007/978-3-540-85363-3_37 |
Book ISBNs |
978-3-54-085362-6, 978-3-54-085363-3
|
Authors |
Dan Gutfreund, Salil Vadhan, Gutfreund, Dan, Vadhan, Salil |
Mendeley readers
The data shown below were compiled from readership statistics for 8 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Japan | 2 | 25% |
Unknown | 6 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 38% |
Professor | 1 | 13% |
Professor > Associate Professor | 1 | 13% |
Student > Bachelor | 1 | 13% |
Unknown | 2 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 6 | 75% |
Unknown | 2 | 25% |