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 |
The Query Complexity of Program Checking by Constant-Depth Circuits
|
---|---|
Chapter number | 13 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 1999
|
DOI | 10.1007/3-540-46632-0_13 |
Book ISBNs |
978-3-54-066916-6, 978-3-54-046632-1
|
Authors |
V. Arvind, K. V. Subrahmanyam, N. V. Vinodchandran, Arvind, V., Subrahmanyam, K. V., Vinodchandran, N. V. |
Mendeley readers
The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 100% |