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 the Minimal Polynomial
|
---|---|
Chapter number | 36 |
Book title |
Mathematical Foundations of Computer Science 2001
|
Published by |
Springer Berlin Heidelberg, January 2001
|
DOI | 10.1007/3-540-44683-4_36 |
Book ISBNs |
978-3-54-042496-3, 978-3-54-044683-5
|
Authors |
Thanh Minh Hoang, Thomas Thierauf, Hoang, Thanh Minh, Thierauf, Thomas |
Editors |
Jiří Sgall, Aleš Pultr, Petr Kolman |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 1 | 50% |
Researcher | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 50% |
Unknown | 1 | 50% |