%0 Conference Paper %1 conf/focs/ForbesS13 %A Forbes, Michael A. %A Shpilka, Amir %B FOCS %D 2013 %I IEEE Computer Society %K dblp %P 243-252 %T Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs. %U http://dblp.uni-trier.de/db/conf/focs/focs2013.html#ForbesS13 %@ 978-0-7695-5135-7

@inproceedings{conf/focs/ForbesS13, added-at = {2014-12-16T00:00:00.000+0100}, author = {Forbes, Michael A. and Shpilka, Amir}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2aa826931ebae0f70023577d09be4e666/dblp}, booktitle = {FOCS}, crossref = {conf/focs/2013}, ee = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2013.34}, interhash = {6e6334c5dc743751f8add71afca10a8d}, intrahash = {aa826931ebae0f70023577d09be4e666}, isbn = {978-0-7695-5135-7}, keywords = {dblp}, pages = {243-252}, publisher = {IEEE Computer Society}, timestamp = {2016-02-02T14:20:59.000+0100}, title = {Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs.}, url = {http://dblp.uni-trier.de/db/conf/focs/focs2013.html#ForbesS13}, year = 2013 }