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 |
Approximating the unsatisfiability threshold of random formulas (Extended Abstract)
|
---|---|
Chapter number | 44 |
Book title |
Algorithms — ESA '96
|
Published by |
Springer, Berlin, Heidelberg, September 1996
|
DOI | 10.1007/3-540-61680-2_44 |
Book ISBNs |
978-3-54-061680-1, 978-3-54-070667-0
|
Authors |
Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Kirousis, Lefteris M., Kranakis, Evangelos, Krizanc, Danny |
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 % |
---|---|---|
Sweden | 1 | 14% |
France | 1 | 14% |
Unknown | 5 | 71% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 29% |
Researcher | 2 | 29% |
Professor | 1 | 14% |
Student > Doctoral Student | 1 | 14% |
Unknown | 1 | 14% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 71% |
Unknown | 2 | 29% |