{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:38Z","timestamp":1750306238103,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055442","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"831-841","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Randomized polynomial time identity testing for noncommutative circuits"],"prefix":"10.1145","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[{"name":"Institute of Mathematical Sciences, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pushkar S","family":"Joglekar","sequence":"additional","affiliation":[{"name":"Vishwakarma Institute of Technology Pune, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Raja","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/140975103"},{"key":"e_1_3_2_2_2_1","unstructured":"Avraham Shimshon Amitsur and Jacob Levitzki. 1950.  Avraham Shimshon Amitsur and Jacob Levitzki. 1950."},{"key":"e_1_3_2_2_3_1","volume-title":"Proc. Amer. Math. Soc. 4","author":"Minimal","year":"1950","unstructured":"Minimal identities for algebras . Proc. Amer. Math. Soc. 4 ( 1950 ), 449\u2013463. Minimal identities for algebras. Proc. Amer. Math. Soc. 4 (1950), 449\u2013463."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0299-8"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2005.13"},{"key":"e_1_3_2_2_6_1","volume-title":"Lipton","author":"DeMillo Richard A.","year":"1978","unstructured":"Richard A. DeMillo and Richard J . Lipton . 1978 . Richard A. DeMillo and Richard J. Lipton. 1978."},{"key":"e_1_3_2_2_7_1","volume-title":"Lett. 7, 4","author":"Algebraic Program Testing A Probabilistic Remark","year":"1978","unstructured":"A Probabilistic Remark on Algebraic Program Testing . Inf. Process . Lett. 7, 4 ( 1978 ), 193\u2013195. A Probabilistic Remark on Algebraic Program Testing. Inf. Process. Lett. 7, 4 (1978), 193\u2013195."},{"key":"e_1_3_2_2_8_1","volume-title":"Forbes and Amir Shpilka","author":"Michael","year":"2013","unstructured":"Michael A. Forbes and Amir Shpilka . 2013 . Michael A. Forbes and Amir Shpilka. 2013."},{"key":"e_1_3_2_2_9_1","volume-title":"Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013","author":"Quasipolynomial-Time","year":"2013","unstructured":"Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013 , 26-29 October , 2013 , Berkeley, CA, USA. 243\u2013252. Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA. 243\u2013252."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.31"},{"key":"e_1_3_2_2_11_1","unstructured":"Neeraj Kayal Chandan Saha and Ramprasad Saptharishi. 2014.  Neeraj Kayal Chandan Saha and Ramprasad Saptharishi. 2014."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591847"},{"key":"e_1_3_2_2_13_1","volume-title":"WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings. 14\u201326","author":"Lohrey Markus","year":"2015","unstructured":"Markus Lohrey . 2015 . Equality Testing of Compressed Strings. In Combinatorics on Words - 10th International Conference , WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings. 14\u201326 . Markus Lohrey. 2015. Equality Testing of Compressed Strings. In Combinatorics on Words - 10th International Conference, WORDS 2015, Kiel, Germany, September 14-17, 2015, Proceedings. 14\u201326."},{"key":"e_1_3_2_2_14_1","unstructured":"Kurt Mehlhorn R. Sundar and Christian Uhrig. 1997.  Kurt Mehlhorn R. Sundar and Christian Uhrig. 1997."},{"key":"e_1_3_2_2_15_1","volume-title":"183\u2013198","author":"Sequences Maintaining Dynamic","year":"1997","unstructured":"Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time . Algorithmica 17, 2 ( 1997 ), 183\u2013198 . Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17, 2 (1997), 183\u2013198."},{"key":"e_1_3_2_2_16_1","unstructured":"Noam Nisan. 1991.  Noam Nisan. 1991."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103462"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647904.739319"},{"key":"e_1_3_2_2_19_1","unstructured":"Claudio Procesi. 2013.  Claudio Procesi. 2013."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055442"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-005-0188-8"},{"key":"e_1_3_2_2_22_1","unstructured":"Nitin Saxena and C. Seshadhri. 2013.  Nitin Saxena and C. Seshadhri. 2013."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528403"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/646670.698972"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montreal Canada","acronym":"STOC '17"},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055442","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:27Z","timestamp":1750220607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":25,"alternative-id":["10.1145\/3055399.3055442","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055442","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}