Automata, Languages and Programming
Springer Science & Business Media
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.
Timeline
Mendeley readers
| Chapter title |
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently
|
|---|---|
| Chapter number | 26 |
| Book title |
Automata, Languages and Programming
|
| Published by |
Springer, Berlin, Heidelberg, July 2001
|
| DOI | 10.1007/3-540-48224-5_26 |
| Book ISBNs |
978-3-54-042287-7, 978-3-54-048224-6
|
| Authors |
Joel Friedman, Andreas Goerdt |
Mendeley readers
The data shown below were compiled from readership statistics for 18 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 18 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 7 | 39% |
| Student > Master | 3 | 17% |
| Lecturer | 2 | 11% |
| Researcher | 2 | 11% |
| Professor > Associate Professor | 2 | 11% |
| Other | 0 | 0% |
| Unknown | 2 | 11% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 13 | 72% |
| Mathematics | 1 | 6% |
| Agricultural and Biological Sciences | 1 | 6% |
| Physics and Astronomy | 1 | 6% |
| Unknown | 2 | 11% |