The sketching complexity of graph and hypergraph counting

DOI10.1109/FOCS.2018.00059MaRDI QIDQ6944355zbMATH OpenFDO

Authors Eric Price, John Kallaugher, Michael Kapralov

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2018.00059

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

Cited in

(2)

• Counting simplices in hypergraph streams
• Even the easiest(?) Graph coloring problem is not easy in streaming!

This page was built for publication: The sketching complexity of graph and hypergraph counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944355)