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 |
The Complexity of Algorithmic Problems on Succinct Instances
|
---|---|
Chapter number | 30 |
Book title |
Computer Science
|
Published by |
Springer, Boston, MA, January 1992
|
DOI | 10.1007/978-1-4615-3422-8_30 |
Book ISBNs |
978-1-4613-6513-6, 978-1-4615-3422-8
|
Authors |
José L. Balcázar, Antoni Lozano, Jacobo Torán, Balcázar, José L., Lozano, Antoni, Torán, Jacobo |
Mendeley readers
The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 10 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 3 | 30% |
Student > Ph. D. Student | 2 | 20% |
Professor > Associate Professor | 1 | 10% |
Professor | 1 | 10% |
Unknown | 3 | 30% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 6 | 60% |
Physics and Astronomy | 1 | 10% |
Unknown | 3 | 30% |