@article{DBLP:journals/cjtcs/ArvindSV02,
author = {Vikraman Arvind and
K. V. Subrahmanyam and
N. V. Vinodchandran},
title = {The Query Complexity of Program Checking by Constant-Depth
Circuits},
journal = {Chicago J. Theor. Comput. Sci.},
volume = {2002},
year = {2002},
ee = {http://cjtcs.cs.uchicago.edu/articles/2002/2/contents.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Last update 2005-11-16 CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
