Explicit near-Ramanujan graphs of every degree
From MaRDI portal
Publication:5144938
DOI10.1145/3357713.3384231OpenAlexW3035192619MaRDI QIDQ5144938
Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes
Publication date: 19 January 2021
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.06988
Related Items (4)
A spectral condition for spectral gap: fast mixing in high-temperature Ising models ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Explicit non-malleable codes from bipartite graphs ⋮ Deterministic Tensor Completion with Hypergraph Expanders
This page was built for publication: Explicit near-Ramanujan graphs of every degree