Linear sketching over F<inf>2</inf>

Abstract

© Sampath Kannan, Elchanan Mossel, Swagato Sanyal, and Grigory Yaroslavtsev; licensed under Creative Commons License CC-BY 33rd Computational Complexity Conference (CCC 2018). We initiate a systematic study of linear sketching over F2. For a given Boolean function treated as f: F2 → F 2 a randomized F2-sketch is a distribution M over d × n matrices with elements over F2 such that Mx suffices for computing f(x) with high probability. Such sketches for d << n can be used to design small-space distributed and streaming algorithms. Motivated by these applications we study a connection between F2-sketching and a two-player one-way communication game for the corresponding XOR-function. We conjecture that F2-sketching is optimal for this communication game. Our results confirm this conjecture for multiple important classes of functions: 1) low-degree F2-polynomials, 2) functions with sparse Fourier spectrum, 3) most symmetric functions, 4) recursive majority function. These results rely on a new structural theorem that shows that F2-sketching is optimal (up to constant factors) for uniformly distributed inputs. Furthermore, we show that (non-uniform) streaming algorithms that have to process random updates over F2 can be constructed as F2-sketches for the uniform distribution. In contrast with the previous work of Li, Nguyen and Woodruff (STOC'14) who show an analogous result for linear sketches over integers in the adversarial setting our result does not require the stream length to be triply exponential in n and holds for streams of length Õ(n) constructed through uniformly random updates.