Small-Bias Spaces for Group Products

Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting of group products. Besides being natural, our extension captures some of the difficulties in constructing pseudorandom generators for constant-width branching programs - a longstanding open problem. We provide an efficient deterministic construction of small-bias spaces for solvable groups. Our construction exploits the fact that solvable groups have nontrivial normal subgroups that are abelian and builds on the construction of Azar et al. [AMN98] for abelian groups. For arbitrary finite groups, we give an efficient deterministic construction achieving constant bias. We also construct pseudorandom generators fooling linear functions mod p for primes p.

• Type: Conference
• Year: 2009
• Where: APPROX
• Authors: Raghu Meka, David Zuckerman
• Keywords: Algorithms, APPROX 2009, Efficient Deterministic Construction, Small-bias Spaces, Solvable Groups