Explicit SoS lower bounds from high-dimensional expanders
From MaRDI portal
Cites work
- A Moore bound for simplicial complexes
- A short proof of Gromov's filling inequality
- Agreement testing theorems on layered set systems
- Approximating constraint satisfaction problems on high-dimensional expanders
- Approximation Resistance from Pairwise-Independent Subgroups
- Bounded degree cosystolic expanders of every dimension
- Buildings
- Buildings and their applications in geometry and topology
- CSP gaps and reductions in the lasserre hierarchy
- Explicit constructions of Ramanujan complexes of type A_d.
- Filling Riemannian manifolds
- High dimensional expanders and property testing
- High dimensional expanders imply agreement expanders
- Homological connectivity of random 2-complexes
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- Improved analysis of higher order random walks and applications
- Isoperimetric inequalities for Ramanujan complexes and topological expanders
- Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
- List Decoding of Direct Sum Codes
- List decoding with double samplers
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
- Mixing properties and the chromatic number of Ramanujan complexes
- Notes on Gromov's systolic estimate
- On eigenvalues of random complexes
- Ramanujan complexes of type \(\widetilde A_d\)
- Rounding Semidefinite Programming Hierarchies via Global Correlation
- Semialgebraic Proofs and Efficient Algorithm Design
- Short proofs are narrow—resolution made simple
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- Sum of squares lower bounds for refuting any CSP
- Testing Odd Direct Sums Using High Dimensional Expanders
Cited in
(1)
This page was built for publication: Explicit SoS lower bounds from high-dimensional expanders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229325)
