The Query Complexity of Program Checking by Constant-Depth Circuits
Download:
|
|
by V. Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
http://www.brics.dk/~vinod/papers/checking.ps
Add To MetaCart
Abstract:
In this paper we study program checking (in the sense of Blum and Kannan [7]) using AC 0 circuits as checkers. Our focus is 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 both deterministic and randomized AC 0 checkers. We show that, for each ffl? 0, \Omega\Gamma n
Citations
| 692 | The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract – Goldwasser, Micali, et al. - 1985 |
| 259 | Designing programs that check their work – Blum, Kannan - 1989 |
| 233 | Self-testing/correcting with applications to numerical problems – Blum, Luby, et al. - 1993 |
| 182 | M.Szegedy. Proof verification and intractability of approximation problems – Arora, Lund, et al. - 1998 |
| 125 | Computational limitations on small depth circuits – HËšastad - 1986 |
| 96 | Sigma 1 -formulae on finite structures – Ajtai - 1983 |
| 8 | Efficient checkers for number-theoretic computations – Adleman, Huang, et al. - 1995 |
| 3 | oning, Robust algorithms: a different approach to oracles – Sch - 1985 |
| 1 | Constructivizing membership proofs in complexity classes – Arvind - 1997 |
