Circuit Lower Bounds, Help Functions, and the Remote Point Problem
Computational Complexity
2009-11-24 v1
Abstract
We investigate the power of Algebraic Branching Programs (ABPs) augmented with help polynomials, and constant-depth Boolean circuits augmented with help functions. We relate the problem of proving explicit lower bounds in both these models to the Remote Point Problem (introduced by Alon, Panigrahy, and Yekhanin (RANDOM '09)). More precisely, proving lower bounds for ABPs with help polynomials is related to the Remote Point Problem w.r.t. the rank metric, and for constant-depth circuits with help functions it is related to the Remote Point Problem w.r.t. the Hamming metric. For algebraic branching programs with help polynomials with some degree restrictions we show exponential size lower bounds for explicit polynomials.
Keywords
Cite
@article{arxiv.0911.4337,
title = {Circuit Lower Bounds, Help Functions, and the Remote Point Problem},
author = {Vikraman Arvind and Srikanth Srinivasan},
journal= {arXiv preprint arXiv:0911.4337},
year = {2009}
}