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 |
Polynomially bounded minimization problems which are hard to approximate
|
---|---|
Chapter number | 61 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 1993
|
DOI | 10.1007/3-540-56939-1_61 |
Book ISBNs |
978-3-54-056939-8, 978-3-54-047826-3
|
Authors |
Viggo Kann, Kann, Viggo |
Mendeley readers
The data shown below were compiled from readership statistics for 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Germany | 1 | 11% |
Brazil | 1 | 11% |
Unknown | 7 | 78% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 33% |
Professor > Associate Professor | 2 | 22% |
Professor | 1 | 11% |
Researcher | 1 | 11% |
Student > Bachelor | 1 | 11% |
Other | 0 | 0% |
Unknown | 1 | 11% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 6 | 67% |
Mathematics | 2 | 22% |
Unknown | 1 | 11% |