Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs

Michael A. Forbes, Amir Shpilka. Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), 19:115, 2012. [doi]

Authors

Michael A. Forbes

This author has not been identified. Look up 'Michael A. Forbes' in Google

Amir Shpilka

This author has not been identified. Look up 'Amir Shpilka' in Google