Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Some 3CNF Properties Are Hard to Test
SIAM Journal on Computing
Homological Connectivity Of Random 2-Complexes
Combinatorica
Homological connectivity of random k-dimensional complexes
Random Structures & Algorithms
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)
SIAM Journal on Computing
On laplacians of random complexes
Proceedings of the twenty-eighth annual symposium on Computational geometry
Linearity testing in characteristic two
IEEE Transactions on Information Theory - Part 1
Hi-index | 0.00 |
We show that the high dimensional expansion property as defined by Gromov, Linial and Meshulam, for simplicial complexes is a form of testability. Namely, a simplicial complex is a high dimensional expander iff a suitable property is testable. Using this connection, we derive several testability results.