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 |
On the Complexity of Trial and Error for Constraint Satisfaction Problems
|
---|---|
Chapter number | 55 |
Book title |
Automata, Languages, and Programming
|
Published in |
Lecture notes in computer science, January 2014
|
DOI | 10.1007/978-3-662-43948-7_55 |
Book ISBNs |
978-3-66-243947-0, 978-3-66-243948-7
|
Authors |
Ivanyos, Gábor, Kulkarni, Raghav, Qiao, Youming, Santha, Miklos, Sundaram, Aarthi, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram |
Mendeley readers
The data shown below were compiled from readership statistics for 17 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 17 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 5 | 29% |
Researcher | 3 | 18% |
Student > Master | 2 | 12% |
Professor | 1 | 6% |
Lecturer > Senior Lecturer | 1 | 6% |
Other | 2 | 12% |
Unknown | 3 | 18% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 12 | 71% |
Physics and Astronomy | 1 | 6% |
Unknown | 4 | 24% |