Expander random walks: a Fourier-analytic approach

DOI10.1145/3406325.3451049OpenAlexW3167861893MaRDI QIDQ6065282

Unnamed Author, Gil Cohen, Amnon Ta-Shma

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3406325.3451049

zbMATH Keywords

computational complexitycombinatorics and graph theoryrandomness in computing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Paradigms for Unconditional Pseudorandom Generators

This page was built for publication: Expander random walks: a Fourier-analytic approach