Fetching the paper…
Reading the bibliography…
We introduce a framework of layered subsets, and give a sufficient condition for when a set system supports an agreement test.
p p -adic curvature and the cohomology of discrete subgroups of p p -adic groups
Howard Garland · 1973
Earlier work this paper cites.
Robust characterizations of polynomials with applications to program testing
Ronitt Rubinfeld and Madhu Sudan · 1996
Earlier work this paper cites.
Improved low degree testing and its applications
Sanjeev Arora and Madhu Sudan · 1997
Earlier work this paper cites.
A combinatorial consistency lemma with application to proving the PCP theorem
Oded Goldreich and Shmuel Safra · 1997
Earlier work this paper cites.
A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of np
Ran Raz and Shmuel Safra · 1997
Earlier work this paper cites.
Explicit constructions of ramanujan complexes of type
Alexander Lubotzky, Beth Samuels, and Uzi Vishne · 2005
Earlier work this paper cites.
Ramanujan complexes of type A d ~ \tilde{A_{d}}
Alexander Lubotzky, Beth Samuels, and Uzi Vishne · 2005
Earlier work this paper cites.
Assignment testers: Towards combinatorial proofs of the PCP theorem
Irit Dinur and Omer Reingold · 2006
Earlier work this paper cites.
The PCP theorem by gap amplification
Irit Dinur · 2007
Earlier work this paper cites.
Locally testing direct products in the low error range
Irit Dinur and Elazar Goldenberg · 2008
Earlier work this paper cites.
New direct-product testers and 2-query PCPs
Russell Impagliazzo, Valentine Kabanets, and Avi Wigderson · 2012
Earlier work this paper cites.
Direct product testing
I. Dinur and D. Steurer · 2014
Cited alongside, same era.
High dimensional expanders and property testing
Tali Kaufman and Alexander Lubotzky · 2014
Cited alongside, same era.
Mixing Properties and the Chromatic Number of Ramanujan Complexes
Alexander Lubotzky, Konstantin Golubev, and Shai Evra · 2015
Cited alongside, same era.
Bounded degree cosystolic expanders of every dimension
Shai Evra and Tali Kaufman · 2016
Cited alongside, same era.
Cube vs. cube low degree test
Amey Bhangale, Irit Dinur, and Inbal Livni Navon · 2017
Cited alongside, same era.
High dimensional expanders imply agreement expanders
Irit Dinur and Tali Kaufman · 2017
Cited alongside, same era.
Boolean function analysis on high-dimensional expanders
Yotam Dikstein, Irit Dinur, Yuval Filmus, and Prahladh Harsha · 2018
Later among the works it cites.
Towards a proof of the 2-to-1 games conjecture?
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra · 2018
Later among the works it cites.
Pseudorandom sets in grassmann graph have near-perfect expansion
Subhash Khot, Dor Minzer, and Muli Safra · 2018
Later among the works it cites.
Construction of new local spectral high dimensional expanders
Tali Kaufman and Izhar Oppenheim · 2018
Later among the works it cites.
High order random walks: Beyond spectral gap
Tali Kaufman and Izhar Oppenheim · 2018
Later among the works it cites.
Local spectral expansion approach to high dimensional expanders part I: Descent of spectral gaps
Izhar Oppenheim · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Irit Dinur and Inbal Livni Navon · 2017
Cited alongside, same era.
High dimensional random walks and colorful expansion
Tali Kaufman and David Mass · 2017
Cited alongside, same era.
On independent sets, 2-to-2 games, and Grassmann graphs
Subhash Khot, Dor Minzer, and Muli Safra · 2017
Cited alongside, same era.
Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant · 2018
Cited alongside, same era.
Local spectral expansion approach to high dimensional expanders part ii: Mixing and geometrical overlapping, 2018
Izhar Oppenheim · 2018
Later among the works it cites.
Approximating constraint satisfaction problems on high-dimensional expanders
Vedat Levi Alev, Fernando Granha Jeronimo, and Madhur Tulsiani · 2019
Closest in time.
Small-set expansion in shortcode graph and the 2-to-2 conjecture
Boaz Barak, Pravesh K. Kothari, and David Steurer · 2019
Closest in time.
Analyzing boolean functions on the biased hypercube via higher-dimensional agreement tests: [extended abstract]
Irit Dinur, Yuval Filmus, and Prahladh Harsha · 2019
Closest in time.