期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2010
卷号：2010
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：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(lognlog1) , where n is the length of the word and is the error. The result is equivalent to the statement that the pseudorandom generator fools read-once permutation branching programs of constant width.
