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 |
What is a hard instance of a computational problem?
|
---|---|
Chapter number | 99 |
Book title |
Structure in Complexity Theory
|
Published by |
Springer, Berlin, Heidelberg, January 1986
|
DOI | 10.1007/3-540-16486-3_99 |
Book ISBNs |
978-3-54-016486-9, 978-3-54-039825-7
|
Authors |
Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe, Ko, Ker-I, Orponen, Pekka, Schöning, Uwe, Watanabe, Osamu |
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 % |
---|---|---|
United States | 1 | 13% |
Unknown | 7 | 88% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 4 | 50% |
Student > Ph. D. Student | 2 | 25% |
Professor | 1 | 13% |
Student > Doctoral Student | 1 | 13% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 8 | 100% |