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 |
Certifying Unsatisfiability of Random 2 k -SAT Formulas Using Approximation Techniques
|
---|---|
Chapter number | 3 |
Book title |
Fundamentals of Computation Theory
|
Published by |
Springer, Berlin, Heidelberg, August 2003
|
DOI | 10.1007/978-3-540-45077-1_3 |
Book ISBNs |
978-3-54-040543-6, 978-3-54-045077-1
|
Authors |
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich, Coja-Oghlan, Amin, Goerdt, Andreas, Lanka, André, Schädlich, Frank |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 1 | 50% |
Student > Ph. D. Student | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 50% |
Unknown | 1 | 50% |