{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:10Z","timestamp":1746295810727,"version":"3.40.4"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_49","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"572-583","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Bounded Register and Skew Arithmetic Computation"],"prefix":"10.1007","author":[{"given":"Vikraman","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Raja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"49_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(97)00227-2","volume":"209","author":"E. Allender","year":"1998","unstructured":"Allender, E., Jiao, J., Mahajan, M., Vinay, V.: Non-commutative arithmetic circuits: Depth reduction and size lower bounds. Theor. Comput. Sci.\u00a0209(1-2), 47\u201386 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"49_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/978-3-642-22006-7_62","volume-title":"Automata, Languages and Programming","author":"E. Allender","year":"2011","unstructured":"Allender, E., Wang, F.: On the power of algebraic branching programs of width two. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 736\u2013747. Springer, Heidelberg (2011)"},{"unstructured":"Arvind, V., Joglekar, P.S., Srinivasan, S.: Arithmetic circuits and the hadamard product of polynomials. In: FSTTCS, pp. 25\u201336 (2009)","key":"49_CR3"},{"key":"49_CR4","first-page":"28","volume":"21","author":"V. Arvind","year":"2014","unstructured":"Arvind, V., Raja, S.: The Complexity of Two Register and Skew Arithmetic Computation. Electronic Colloquium on Computational Complexity (ECCC)\u00a021, 28 (2014)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Cleve, R.: Computing algebraic formulas with a constant number of registers. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC), pp. 254\u2013257. ACM (1988)","key":"49_CR5","DOI":"10.1145\/62212.62236"},{"issue":"1","key":"49_CR6","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0221006","volume":"21","author":"M. Ben-Or","year":"1992","unstructured":"Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. SIAM Journal on Computing\u00a021(1), 54\u201358 (1992)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"49_CR7","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539705447359","volume":"37","author":"S. Chien","year":"2007","unstructured":"Chien, S., Sinclair, A.: Algebras with polynomial identities and computing the determinant. SIAM Journal on Computing\u00a037(1), 252\u2013266 (2007)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Nisan, N.: Lower bounds for non-commutative computation (extended abstract). In: STOC, pp. 410\u2013418 (1991)","key":"49_CR8","DOI":"10.1145\/103418.103462"},{"issue":"1","key":"49_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-005-0188-8","volume":"14","author":"R. Raz","year":"2005","unstructured":"Raz, R., Shpilka, A.: Deterministic polynomial identity testing in non-commutative models. Computational Complexity\u00a014(1), 1\u201319 (2005)","journal-title":"Computational Complexity"},{"doi-asserted-by":"crossref","unstructured":"Hrubes, P., Wigderson, A., Yehudayoff, A.: Noncommutative arithmetic circuits and the sum-of-squares problem. In: STOC 2010 (2010)","key":"49_CR10","DOI":"10.1145\/1806689.1806781"},{"unstructured":"Limaye, N., Malod, G., Srinivasan, S.: Talk at an arithmetic circuits workshop (February 2014)","key":"49_CR11"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:49:07Z","timestamp":1746294547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}