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 |
A combinatorial consistency lemma with application to proving the PCP theorem
|
---|---|
Chapter number | 7 |
Book title |
Randomization and Approximation Techniques in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, July 1997
|
DOI | 10.1007/3-540-63248-4_7 |
Book ISBNs |
978-3-54-063248-1, 978-3-54-069247-8
|
Authors |
Oded Goldreich, Shmuel Safra |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Japan | 1 | 25% |
Unknown | 3 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 50% |
Professor | 1 | 25% |
Student > Bachelor | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 100% |