@inproceedings{024239fd677b4b66827c8f5c2b59c74d,
title = "High dimensional expanders imply agreement expanders",
abstract = "We show that high dimensional expanders imply derandomized direct product tests, with a number of subsets that is linear in the size of the universe. Direct product tests belong to a family of tests called agreement tests that are important components in PCP constructions and include, for example, low degree tests such as line vs. line and plane vs. plane. For a generic hypergraph, we introduce the notion of agreement expansion, which captures the usefulness of the hypergraph for an agreement test. We show that explicit bounded degree agreement expanders exist, based on Ramanujan complexes. ",
keywords = "agreement tests, direct product, direct sum, high dimensional expanders",
author = "Irit Dinur and Tali Kaufman",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS) ; Conference date: 15-10-2017 Through 17-10-2017",
year = "2017",
month = nov,
day = "10",
doi = "10.1109/FOCS.2017.94",
language = "English",
series = "Annual IEEE Symposium on Foundations of Computer Science",
publisher = "IEEE Computer Society",
pages = "974--985",
booktitle = "Proceedings - 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017",
address = "United States",
}