Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka. Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. Electronic Colloquium on Computational Complexity (ECCC), 20:132, 2013. [doi]

The following publications are possibly variants of this publication:

Hitting sets for multilinear read-once algebraic branching programs, in any orderMichael A. Forbes, Ramprasad Saptharishi, Amir Shpilka. stoc 2014: 867-875 [doi]

Pseudorandom Generators for Read-Once Branching Programs, in Any OrderMichael A. Forbes, Zander Kelley. focs 2018: 946-955 [doi]

Pseudorandom Generators for Read-Once Branching Programs, in any OrderMichael A. Forbes, Zander Kelley. eccc, 25:147, 2018. [doi]

Polynomial identity testing of read-once oblivious algebraic branching programsMichael A. Forbes. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 2014. [doi]

runs on WebDSL