Combinatorics and Complexity of Partition Functions
Springer
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.
Timeline
Mendeley readers
| Title |
Combinatorics and Complexity of Partition Functions
|
|---|---|
| Published by |
Springer, March 2017
|
| DOI | 10.1007/978-3-319-51829-9 |
| ISBNs |
978-3-31-951829-9, 978-3-31-951828-2
|
| Authors |
Barvinok, Alexander |
Mendeley readers
The data shown below were compiled from readership statistics for 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 13 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Researcher | 5 | 38% |
| Professor > Associate Professor | 2 | 15% |
| Other | 1 | 8% |
| Student > Ph. D. Student | 1 | 8% |
| Lecturer | 1 | 8% |
| Other | 2 | 15% |
| Unknown | 1 | 8% |
| Readers by discipline | Count | As % |
|---|---|---|
| Mathematics | 4 | 31% |
| Physics and Astronomy | 4 | 31% |
| Computer Science | 3 | 23% |
| Unknown | 2 | 15% |