@inproceedings{8078f2ebd2f342678990b7e588049b6b,
title = "Simplifying Armoni's PRG",
abstract = "We propose a simple variant of the INW pseudo-random generator, where blocks have varying lengths, and prove it gives the same parameters as the more complicated construction of Armoni's PRG. This shows there is no need for the specialized PRGs of Nisan and Zuckerman and Armoni, and they can be obtained as simple variants of INW. For the construction to work we need space-efficient extractors with tiny entropy loss. We use the extractors from [2] instead of [6] taking advantage of the very high min-entropy regime we work with. We remark that using these extractors has the additional benefit of making the dependence on the branching program alphabet ∑ correct.",
keywords = "PRG, ROBP, armoni, derandomization, psuedorandom, random, read-once",
author = "Ben Chen and Amnon Ta-Shma",
note = "Publisher Copyright: {\textcopyright} Ben Chen and Amnon Ta-Shma; licensed under Creative Commons License CC-BY 4.0.; 28th International Conference on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2025 and the 29th International Conference on Randomization and Computation, RANDOM 2025 ; Conference date: 11-08-2025 Through 13-08-2025",
year = "2025",
month = sep,
day = "15",
doi = "10.4230/LIPIcs.APPROX/RANDOM.2025.36",
language = "אנגלית",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Alina Ene and Eshan Chattopadhyay",
booktitle = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2025",
address = "גרמניה",
}