The Query Complexity of Program Checking by Constant-Depth Circuits
We study program result checking using AC0 circuits as checkers. We focus on the number of queries made by the checker to the program being checked and we term this as the query complexity of the checker for the given problem. We study the query complexity of deterministic and randomized AC0 checkers for certain P-complete and NC1-complete problems. We show that for each ε > 0, Ω(n 1 ε) is a lower bound to the query complexity of deterministic AC0 checkers for the considered problems, for inputs of length n. On the other hand, we show that suitably encoded complete problems for P and NC1 have randomi- zed AC0 checkers of constant query complexity. The latter results are proved using techniques from the PCP(n 3, 1) protocol for 3-SAT in .
KeywordsConstant Number Query Complexity Input Circuit Query Answer Program Check
Unable to display preview. Download preview PDF.
- 2.M. Ajtai,11 formulas on finite structures, Annals of Pure and Applied Logic, 24, (1983) 1–48.Google Scholar
- 4.S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof Verification and the intractability of approximation problems. In Proceedings 33rd Symposium on the Foundations of Computer Science, 14–23, IEEE Computer Society Press, 1992.Google Scholar
- 8.J. Hastad, Computational limitations for small depth circuits. M.I.T. press, Cambridge, MA, 1986.Google Scholar
- 9.R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.Google Scholar