Local expansion of vertex-transitive graphs and random generation in finite groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Undirected connectivity in log-space
Journal of the ACM (JACM)
Random Cayley graphs and expanders
Random Structures & Algorithms
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
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
IEEE Transactions on Information Theory - Part 2
| Hi-index | 0.00 |
Let G=〈S〉 be a solvable subgroup of the symmetric group Sn given as input by the generator set S. We give a deterministic polynomial-time algorithm that computes an expanding generator set of size Õ(n2) for G. As a byproduct of our proof, we obtain a new explicit construction of ε-bias spaces of size Õ$(n{\rm poly}({\rm log} d))({{1}\over{\varepsilon}})^{O(1)}$ for the groups $\mathbb{Z}_d^n$.