Articles under category:
Branching Programs
Branching Programs
|
Vol 18, Article 21 (pp 1-32)
[CCC20 Spec Issue]
Hitting Sets Give Two-Sided Derandomization of Small Space by Kuan Cheng and William M. Hoza |
|
Vol 16, Article 7 (pp 1-50)
More on Bounded Independence Plus Noise: Pseudorandom Generators for Read-Once Polynomials by Chin Ho Lee and Emanuele Viola |
|
Vol 13, Article 12 (pp 1-50)
[APRX-RND14 Spec Issue]
Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs by Thomas Steinke, Salil Vadhan, and Andrew Wan |
|
Vol 13, Article 2 (pp 1-21)
[CCC16 Spec Issue]
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs by Rohit Gurjar, Arpita Korwar, and Nitin Saxena |
|
Vol 10, Article 15 (pp 389-419)
[Boolean Spec Issue]
Tight Bounds for Monotone Switching Networks via Fourier Analysis by Siu Man Chan and Aaron Potechin |
|
Vol 9, Article 26 (pp 809-843)
On Beating the Hybrid Argument by Bill Fefferman, Ronen Shaltiel, Christopher Umans, and Emanuele Viola |
|
Vol 9, Article 7 (pp 283-293)
Pseudorandomness for Width-2 Branching Programs by Andrej Bogdanov, Zeev Dvir, Elad Verbin, and Amir Yehudayoff |
|
Vol 2, Article 10 (pp 185-206)
Learning Restricted Models of Arithmetic Circuits by Adam Klivans and Amir Shpilka |
|
Vol 1, Article 8 (pp 149-176)
A Non-linear Time Lower Bound for Boolean Branching Programs by Miklós Ajtai |