Almost Optimal SuperConstant-Pass Streaming Lower Bounds for Reachability

. We give an almost quadratic \ (n^2-o (1) \) lower bound on the space usage of any \ (o (n) \) -pass streaming algorithm solving the (directed) \ (s\) -\ (t\) reachability problem. This means that any such algorithm must essentially store the entire graph. As corollaries, we obtain almost quadratic space lower bounds for additional fundamental problems, including maximum matching, shortest path, matrix rank, and linear programming. Our main technical contribution is the definition and construction of set hiding graphs, that may be of independent interest: we give a general way of encoding a set \ (S k\) as a directed graph with \ (n = k^ 1 + o (1) \) vertices, such that deciding whether \ (i S\) boils down to deciding if \ (tᵢ\) is reachable from \ (sᵢ\), for a specific pair of vertices \ ( (sᵢ, tᵢ) \) in the graph. Furthermore, we prove that our graph "hides" \ (S\), in the sense that no low-space streaming algorithm with a small number of passes can learn (almost) anything about \ (S\). Keywordsgraph streamingcommunication complexitylower boundsMSC codes68W27