Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computational Complexity
Journal of Computer and System Sciences
On recycling the randomness of states in space bounded computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Pseudorandom Bit Generators That Fool Modular Sums
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Small-Bias Spaces for Group Products
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
The Coin Problem and Pseudorandomness for Branching Programs
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Pseudorandom Generators for Regular Branching Programs
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Derandomized squaring of graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Learning read-constant polynomials of constant degree modulo composites
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Almost k-wise independent sets establish hitting sets for width-3 1-branching programs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
A sufficient condition for sets hitting the class of read-once branching programs of width 3
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
Hi-index | 0.00 |
We prove that the pseudorandom generator introduced by Impagliazzo et al. (1994) with proper choice of parameters fools group products of a given finite group G. The seed length is O((|G|O(1) + log 1/δ)log n), where n is the length of the word and δ is the allowed error. The result implies that the pseudorandom generator with seed length O((2O(w log w) + log 1/δ)log n) fools read-once permutation branching programs of width w. As an application of the pseudorandom generator one obtains small-bias spaces for products over all finite groups Meka and Zuckerman (2009).