The Coin Problem and Pseudorandomness for Branching Programs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Joshua Brody, Elad Verbin. The Coin Problem and Pseudorandomness for Branching Programs. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA. pages 30-39, IEEE Computer Society, 2010. [doi]

The following publications are possibly variants of this publication:

Pseudorandomness for Width-2 Branching ProgramsAndrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff. toc, 9:283-293, 2013. [doi]

Pseudorandomness for Width 2 Branching ProgramsAndrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff. eccc, 16:70, 2009. [doi]

runs on WebDSL