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

Abstract : 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 group $G$. When $G$ is Abelian, we give an $NC^2$ algorithm for RPP, again using $\epsilon$-bias spaces. For nonabelian $G$, we give a deterministic polynomial-time algorithm for RPP. We also show the connection to construction of expanding generator sets for the group $G^n$. All our algorithms for the RPP achieve essentially the same parameters as [APY09].
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00455338
Contributor : Publications Loria <>
Submitted on : Wednesday, February 10, 2010 - 10:30:26 AM
Last modification on : Monday, August 19, 2019 - 4:20:06 PM
Long-term archiving on : Friday, June 18, 2010 - 7:52:03 PM

File

Arvind.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00455338, version 1

Collections

Citation

Vikraman Arvind, Srikanth Srinivasan. The Remote Point Problem, Small Bias Space, and Expanding Generator Sets. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.59-70. ⟨inria-00455338⟩

Share

Metrics

Record views

136

Files downloads

187