Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma

DOI10.1145/3406325.3451110arXiv2104.04908OpenAlexW3165922329MaRDI QIDQ6087031

Unnamed Author, Sepehr Assadi

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.04908

zbMATH Keywords

communication complexityproperty testingXOR lemmagraph streamingMAXCUTpointer chasing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model

This page was built for publication: Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma