Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > REMOTE POINT PROBLEM:
Reports tagged with Remote point problem:
TR09-105 | 27th October 2009
Vikraman Arvind, Srikanth Srinivasan

The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets

Using $\epsilon$-bias spaces over F_2 , we show that the Remote Point Problem (RPP), introduced by Alon et al [APY09], has an $NC^2$ algorithm (achieving the same parameters as [APY09]). We study a generalization of the Remote Point Problem to groups: we replace F_n by G^n for an arbitrary fixed ... more >>>


TR09-122 | 23rd November 2009
Vikraman Arvind, Srikanth Srinivasan

Circuit Lower Bounds, Help Functions, and the Remote Point Problem

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 ... more >>>




ISSN 1433-8092 | Imprint