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.
|Annual IEEE Symposium on Foundations of Computer Science
|58th IEEE Annual Symposium on Foundations of Computer Science (FOCS)
|١٥/١٠/١٧ → ١٧/١٠/١٧
- !!General Computer Science