Basic Facts about Expander Graphs (Q3088196)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Basic Facts about Expander Graphs	scientific article

Statements

scholarly article

0 references

Basic Facts about Expander Graphs (English)

0 references

0 references

Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation

0 references

publication date

19 August 2011

0 references

zbMATH Keywords

expander graphs

0 references

random walks on graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-22670-0_30

0 references

Eigenvalues and expanders

0 references

Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs

0 references

\(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators

0 references

0 references

Explicit constructions of linear-sized superconcentrators

0 references

Computational Complexity

0 references

Randomness-Efficient Sampling Within NC 1

0 references

Expander graphs and their applications

0 references

Constructive Proofs of Concentration Bounds

0 references

Eigenvalues and expansion of regular graphs

0 references

Ramanujan graphs

0 references

Undirected ST-connectivity in log-space

0 references

Entropy waves, the zig-zag graph product, and new constant-degree expanders

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-22670-0_30

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

books/sp/goldreich2011/Goldreich11o

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3088196

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3088196&oldid=37896704"