{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T21:10:02Z","timestamp":1748466602746,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_19","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"235-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Evaluating Matrix Circuits"],"prefix":"10.1007","author":[{"given":"Daniel","family":"K\u00f6nig","sequence":"first","affiliation":[]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s000370050023","volume":"8","author":"E Allender","year":"1999","unstructured":"Allender, E., Beals, R., Ogihara, M.: The complexity of matrix rank and feasible systems of linear equations. Comput. Complex. 8(2), 99\u2013126 (1999)","journal-title":"Comput. Complex."},{"issue":"5","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/070697926","volume":"38","author":"E Allender","year":"2009","unstructured":"Allender, E., B\u00fcrgisser, P., Kjeldgaard-Pedersen, J., Miltersen, P.B.: On the complexity of numerical analysis. SIAM J. Comput. 38(5), 1987\u20132006 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"19_CR3","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. 209(1\u20132), 47\u201386 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90252-O","volume":"107","author":"C \u00c0lvarez","year":"1993","unstructured":"\u00c0lvarez, C., Jenner, B.: A very hard log-space counting class. Theor. Comput. Sci. 107(1), 3\u201330 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.2307\/1970362","volume":"86","author":"L Auslander","year":"1967","unstructured":"Auslander, L.: On a problem of Philip Hall. Annals of Mathematics 86(2), 112\u2013116 (1967)","journal-title":"Annals of Mathematics"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1137\/S0097539793249530","volume":"26","author":"M Beaudry","year":"1997","unstructured":"Beaudry, M., McKenzie, P., P\u00e9ladeau, P., Th\u00e9rien, D.: Finite monoids: From word to circuit evaluation. SIAM J. Comput. 26(1), 138\u2013152 (1997)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1006\/jabr.2000.8604","volume":"237","author":"DK Biss","year":"2001","unstructured":"Biss, D.K., Dasgupta, S.: A presentation for the unipotent group over rings with identity. Journal of Algebra 237(2), 691\u2013707 (2001)","journal-title":"Journal of Algebra"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"SA Cook","year":"1985","unstructured":"Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Inform. Control 64, 2\u201322 (1985)","journal-title":"Inform. Control"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Barrington, D.A.M.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. System Sci. 65, 695\u2013716 (2002)","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/322358.322373","volume":"30","author":"OH Ibarra","year":"1983","unstructured":"Ibarra, O.H., Moran, S.: Probabilistic algorithms for deciding equivalence of straight-line programs. J. Assoc. Comput. Mach. 30(1), 217\u2013228 (1983)","journal-title":"J. Assoc. Comput. Mach."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Wigderson, A.: P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In: Proc. STOC 1997, pp. 220\u2013229. ACM Press (1997)","DOI":"10.1145\/258533.258590"},{"issue":"1\u20132","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-004-0182-6","volume":"13","author":"V Kabanets","year":"2004","unstructured":"Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Complex. 13(1\u20132), 1\u201346 (2004)","journal-title":"Comput. Complex."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Kargapolov, M.I., Merzljakov, J.I.: Fundamentals of the Theory of Groups. Springer (1979)","DOI":"10.1007\/978-1-4612-9964-6"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, D., Lohrey, M.: Evaluating matrix circuits (2015). arXiv.org","DOI":"10.1007\/978-3-319-21398-9_19"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, D., Lohrey, M.: Parallel identity testing for algebraic branching programs with big powers and applications (2015). arXiv.org","DOI":"10.1007\/978-3-662-48054-0_37"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/322017.322031","volume":"24","author":"RJ Lipton","year":"1977","unstructured":"Lipton, R.J., Zalcstein, Y.: Word problems solvable in logspace. J. Assoc. Comput. Mach. 24(3), 522\u2013526 (1977)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"19_CR17","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1137\/S0097539704445950","volume":"35","author":"M Lohrey","year":"2006","unstructured":"Lohrey, M.: Word problems and membership problems on compressed words. SIAM J. Comput. 35(5), 1210\u20131240 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1515\/gcc-2012-0016","volume":"4","author":"M Lohrey","year":"2012","unstructured":"Lohrey, M.: Algorithmics on SLP-compressed strings: A survey. Groups Complexity Cryptology 4(2), 241\u2013299 (2012)","journal-title":"Groups Complexity Cryptology"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Lohrey, M.: The Compressed Word Problem for Groups. SpringerBriefs in Mathematics. Springer (2014)","DOI":"10.1007\/978-1-4939-0748-9"},{"key":"19_CR20","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196715400068","author":"M Lohrey","year":"2015","unstructured":"Lohrey, M.: Rational subsets of unitriangular groups. International Journal of Algebra and Computation (2015). doi:10.1142\/S0218196715400068","journal-title":"International Journal of Algebra and Computation"},{"key":"19_CR21","unstructured":"Robinson, D.: Parallel Algorithms for Group Word Problems. Ph.D. thesis, UCSD (1993)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Rotman, J.J.: An Introduction to the Theory of Groups, 4th edn. Springer (1995)","DOI":"10.1007\/978-1-4612-4176-8"},{"key":"19_CR23","unstructured":"Simon, H.-U.: Word problems for groups and contextfree recognition. In: Proceedings of Fundamentals of Computation Theory, FCT 1979, pp. 417\u2013422. Akademie-Verlag (1979)"},{"key":"19_CR24","first-page":"573","volume":"18","author":"R Swan","year":"1967","unstructured":"Swan, R.: Representations of polycyclic groups. Proc. Am. Math. Soc. 18, 573\u2013574 (1967)","journal-title":"Proc. Am. Math. Soc."},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Vinay, V.: Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In: Proc. Structure in Complexity Theory Conference, pp. 270\u2013284. IEEE Computer Society (1991)","DOI":"10.1109\/SCT.1991.160269"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Vollmer, H.: Introduction to Circuit Complexity. Springer (1999)","DOI":"10.1007\/978-3-662-03927-4"},{"issue":"4","key":"19_CR27","first-page":"265","volume":"25","author":"S Waack","year":"1991","unstructured":"Waack, S.: On the parallel complexity of linear groups. ITA 25(4), 265\u2013281 (1991)","journal-title":"ITA"},{"key":"19_CR28","unstructured":"Wehrfritz, B.A.F.: Infinite Linear Groups. Springer (1977)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T20:34:03Z","timestamp":1748464443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}