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 |
Complexity Theory and NP-Completeness
|
|---|---|
| Chapter number | 19 |
| Book title |
Computation Engineering
|
| Published by |
Springer, Boston, MA, January 2006
|
| DOI | 10.1007/0-387-32520-4_19 |
| Book ISBNs |
978-0-387-24418-1, 978-0-387-32520-0
|
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Brazil | 1 | 20% |
| Unknown | 4 | 80% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Master | 2 | 40% |
| Professor > Associate Professor | 1 | 20% |
| Student > Postgraduate | 1 | 20% |
| Researcher | 1 | 20% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 2 | 40% |
| Engineering | 2 | 40% |
| Physics and Astronomy | 1 | 20% |