We study the relation between streaming algorithms and linear sketching algorithms, in the context of binary updates. We show that for inputs in n dimensions,
the existence of efficient streaming algorithms which can process \Omega(n^2) updates implies efficient linear sketching algorithms with comparable cost.
This improves upon the previous work ... more >>>