Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q
From MaRDI portal
(Redirected from Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q)
Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\)
Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\)
Cites work
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Cryptography in NC^0
- Error exponents of expander codes
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Expander codes
- Expander graphs and their applications
- Explicit constructions of linear-sized superconcentrators
- Graph Connectivities, Network Coding, and Expander Graphs
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- scientific article; zbMATH DE number 1009713 (Why is no real title available?)
- scientific article; zbMATH DE number 1552123 (Why is no real title available?)
- Interlacing families. IV: Bipartite Ramanujan graphs of all sizes
- Local expanders
- On the second eigenvalue of a graph
- Ramanujan graphs
- The PCP theorem by gap amplification
- Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines
- Towards a Study of Low-Complexity Graphs
- Undirected connectivity in log-space
Cited in
(2)
This page was built for publication: Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6113103)
