Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Designing programs that check their work
Journal of the ACM (JACM)
Efficient checkers for number-theoretic computations
Information and Computation
Randomized algorithms
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
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, Ω(n1-Ɛ) 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 randomized AC0 checkers of constant query complexity. The latter results are proved using techniques from the PCP(n3; 1) protocol for 3-SAT in [4].