The communication complexity of interleaved group products
From MaRDI portal
Publication:2941525
DOI10.1145/2746539.2746560zbMath1321.94063MaRDI QIDQ2941525
Emanuele Viola, Timothy Gowers
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2746539.2746560
representation theory; mixing; conjugacy class; communication complexity; special linear group; interleaved group product; iterated group products; quasirandom group
Related Items
Interleaved Group Products, Unnamed Item, Conjugacy classes, growth and complexity, Mixing, Communication Complexity and Conjectures of Gowers and Viola
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming