Simplifying Armoni's PRG

DOI10.4230/LIPICS.APPROX/RANDOM.2025.36MaRDI QIDQ7346866zbMATH OpenFDO

Authors Ben Chen, Amnon Ta-Shma

Publication date 11 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2025.36

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• Approximating iterated multiplication of stochastic matrices in small space
• Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
• On the derandomization of space-bounded computations
• Pseudorandomness for network algorithms
• Randomness is linear in space
• Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes

This page was built for publication: Simplifying Armoni's PRG

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346866)