Towards the Pseudorandomness of Expander Random Walks for Read-Once ACC0 circuits

Emile Anand

Expander graphs are among the most useful combinatorial objects in theoretical computer science. A line of work studies random walks on expander graphs for their pseudorandomness a…