Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > GROUP PRODUCTS:
Reports tagged with group products:
TR10-113 | 16th July 2010
Michal Koucky, Prajakta Nimbhorkar, Pavel Pudlak

#### Pseudorandom Generators for Group Products

We prove that the pseudorandom generator introduced in Impagliazzo et al. (1994) fools group products of a given finite group. The seed length is $O(\log n \log 1 / \epsilon)$, where $n$ is the length of the word and $\epsilon$ is the error. The result is equivalent to the statement ... more >>>

ISSN 1433-8092 | Imprint