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 |
Propositional Proof Complexity an Introduction
|
|---|---|
| Chapter number | 5 |
| Book title |
Computational Logic
|
| Published by |
Springer, Berlin, Heidelberg, January 1999
|
| DOI | 10.1007/978-3-642-58622-4_5 |
| Book ISBNs |
978-3-64-263670-7, 978-3-64-258622-4
|
| Authors |
Samuel R. Buss |
Mendeley readers
The data shown below were compiled from readership statistics for 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Netherlands | 1 | 14% |
| Russia | 1 | 14% |
| Unknown | 5 | 71% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Master | 2 | 29% |
| Researcher | 2 | 29% |
| Professor | 1 | 14% |
| Lecturer | 1 | 14% |
| Professor > Associate Professor | 1 | 14% |
| Other | 0 | 0% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 5 | 71% |
| Philosophy | 1 | 14% |
| Unknown | 1 | 14% |