@proceedings {671766,
	title = {Pseudorandom generators for read-once monotone branching programs},
	journal = {APPROX/ RANDOM 2021},
	volume = {2021},
	number = {18},
	year = {2021},
	pages = {58:1-58:21},
	publisher = {Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl Leibniz-Zentrum f{\"u}r Informatik },
	edition = {207},
	abstract = {
	Version History: Originally published as "Monotone branching programs: pseudorandomness and circuit complexity".\&nbsp;



	Previously published as "Pseudorandom generators for read-once monotone branching programs",\&nbsp;Electronic Colloquium on Computational Complexity (ECCC) Vol. 2021, Issue 18. Linked here:\&nbsp;https://eccc.weizmann.ac.il/report/2021/018/



	Abstract:\&nbsp;Motivated by the derandomization of space-bounded computation, there has been a long line of work on constructing pseudorandom generators (PRGs) against various forms of read-once branching programs (ROBPs), with a goal of improving the \(O(\log^2n)\) seed length of Nisan{\textquoteright}s classic construction\&nbsp;to the optimal \(O(\log n)\).



	In this work, we construct an explicit PRG with seed length \(\tilde{O}(\log n)\) for constant-width ROBPs that are monotone, meaning that the states at each time step can be ordered so that edges with the same labels never cross each other. Equivalently, for each fixed input, the transition functions are a monotone function of the state. This result is complementary to a line of work that gave PRGs with seed length \(O(\log n)\) for (ordered) permutation ROBPs of constant width, since the monotonicity constraint can be seen as the {\textquotedblleft}opposite{\textquotedblright} of the permutation constraint.



	Our PRG also works for monotone ROBPs that can read the input bits in any order, which are strictly more powerful than read-once \(\mathsf{AC^0}\). Our PRG achieves better parameters (in terms of the dependence on the depth of the circuit) than the best previous pseudorandom generator for read-once \(\mathsf{AC^0}\), due to Doron, Hatami, and Hoza.



	Our pseudorandom generator construction follows Ajtai and Wigderson{\textquoteright}s approach of iterated pseudorandom restrictions. We give a randomness-efficient width-reduction process which proves that the branching program simplifies to an \(O(\log n)\)-junta after only \(O(\log \log n)\) independent applications of the Forbes-Kelley pseudorandom restrictions.

},
	url = {https://drops.dagstuhl.de/opus/volltexte/2021/14751/},
	author = {Dean Doron and Raghu Meka and Omer Reingold and Avishay Tal and Salil Vadhan}
}
