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 |
How lower and upper complexity bounds meet in elimination theory
|
---|---|
Chapter number | 4 |
Book title |
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
|
Published by |
Springer, Berlin, Heidelberg, July 1995
|
DOI | 10.1007/3-540-60114-7_4 |
Book ISBNs |
978-3-54-060114-2, 978-3-54-049440-9
|
Authors |
Luis M. Pardo |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Spain | 1 | 25% |
Unknown | 3 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Postgraduate | 1 | 25% |
Professor > Associate Professor | 1 | 25% |
Researcher | 1 | 25% |
Lecturer | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 2 | 50% |
Business, Management and Accounting | 1 | 25% |
Engineering | 1 | 25% |