@inproceedings{DBLP:conf/focs/ForbesS13,
  author    = {Michael A. Forbes and
               Amir Shpilka},
  title     = {Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once
               Oblivious Algebraic Branching Programs},
  booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  pages     = {243--252},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {https://doi.org/10.1109/FOCS.2013.34},
  doi       = {10.1109/FOCS.2013.34},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/ForbesS13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"9qLvYuxwPJ6uSwoTg","bibbaseid":"forbes-shpilka-quasipolynomialtimeidentitytestingofnoncommutativeandreadonceobliviousalgebraicbranchingprograms-2013","authorIDs":[],"author_short":["Forbes, M. A.","Shpilka, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Michael","A."],"propositions":[],"lastnames":["Forbes"],"suffixes":[]},{"firstnames":["Amir"],"propositions":[],"lastnames":["Shpilka"],"suffixes":[]}],"title":"Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs","booktitle":"54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA","pages":"243–252","publisher":"IEEE Computer Society","year":"2013","url":"https://doi.org/10.1109/FOCS.2013.34","doi":"10.1109/FOCS.2013.34","timestamp":"Wed, 16 Oct 2019 14:14:54 +0200","biburl":"https://dblp.org/rec/conf/focs/ForbesS13.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/focs/ForbesS13,\n author = {Michael A. Forbes and\n Amir Shpilka},\n title = {Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once\n Oblivious Algebraic Branching Programs},\n booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}\n 2013, 26-29 October, 2013, Berkeley, CA, {USA}},\n pages = {243--252},\n publisher = {{IEEE} Computer Society},\n year = {2013},\n url = {https://doi.org/10.1109/FOCS.2013.34},\n doi = {10.1109/FOCS.2013.34},\n timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},\n biburl = {https://dblp.org/rec/conf/focs/ForbesS13.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Forbes, M. A.","Shpilka, A."],"key":"DBLP:conf/focs/ForbesS13","id":"DBLP:conf/focs/ForbesS13","bibbaseid":"forbes-shpilka-quasipolynomialtimeidentitytestingofnoncommutativeandreadonceobliviousalgebraicbranchingprograms-2013","role":"author","urls":{"Paper":"https://doi.org/10.1109/FOCS.2013.34"},"downloads":0},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/93/9942.bib","creationDate":"2020-02-25T21:38:49.774Z","downloads":0,"keywords":[],"search_terms":["quasipolynomial","time","identity","testing","non","commutative","read","once","oblivious","algebraic","branching","programs","forbes","shpilka"],"title":"Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs","year":2013,"dataSources":["vqpLxDotj5ZmjWXjK"]}