Pseudo-mixing Time of Random Walks

DOI10.1007/978-3-030-43662-9_20OpenAlexW2955676237MaRDI QIDQ5098785

Oded Goldreich, Itai Benjamini

Publication date: 30 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43662-9_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• A note on computational indistinguishability
• From Absolute Distinguishability to Positive Distinguishability
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• A Pseudorandom Generator from any One-way Function
• Computational Complexity

This page was built for publication: Pseudo-mixing Time of Random Walks