Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran. The Query Complexity of Program Checking by Constant-Depth Circuits. Chicago J. Theor. Comput. Sci., 2002, 2002. [doi]
@article{ArvindSV02,
title = {The Query Complexity of Program Checking by Constant-Depth Circuits},
author = {Vikraman Arvind and K. V. Subrahmanyam and N. V. Vinodchandran},
year = {2002},
url = {http://cjtcs.cs.uchicago.edu/articles/2002/2/contents.html},
researchr = {https://researchr.org/publication/ArvindSV02},
cites = {0},
citedby = {0},
journal = {Chicago J. Theor. Comput. Sci.},
volume = {2002},
}