Agreement testing theorems on layered set systems

DOI10.1109/FOCS.2019.00088MaRDI QIDQ6944146zbMATH OpenFDO

Authors Irit Dinur, Yotam Dikstein

Publication date 12 August 2025

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

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(6)

• Expanderizing higher-order random walks
• Sparse cuts in hypergraphs from random walks on simplicial complexes
• On the fine-grained complexity of approximating max k-coverage
• Agreement tests on graphs and hypergraphs
• Explicit SoS lower bounds from high-dimensional expanders
• Direct sum and partitionability testing over general groups

This page was built for publication: Agreement testing theorems on layered set systems

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