{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:47:57Z","timestamp":1764557277030},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_16","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T08:44:32Z","timestamp":1343810672000},"page":"148-159","source":"Crossref","is-referenced-by-count":3,"title":["Mortality for 2 \u00d72 Matrices Is NP-Hard"],"prefix":"10.1007","author":[{"given":"Paul C.","family":"Bell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mika","family":"Hirvensalo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Ang, T., Pighizzini, G., Rampersad, N., Shallit, J.: Automata and reduced words in the free group. arXiv:0910.4555 (2009)"},{"issue":"6","key":"16_CR2","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1142\/S0129054110007660","volume":"21","author":"P.C. Bell","year":"2010","unstructured":"Bell, P.C., Potapov, I.: On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups. International Journal of Foundations of Computer Science\u00a021(6), 963\u2013978 (2010)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1-4","key":"16_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2012-663","volume":"116","author":"P.C. Bell","year":"2012","unstructured":"Bell, P.C., Potapov, I.: On the computational complexity of matrix semigroup problems. Fundamenta Informaticae\u00a0116(1-4), 1\u201313 (2012)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00233-007-9024-6","volume":"76","author":"J.-C. Birget","year":"2008","unstructured":"Birget, J.-C., Margolis, S.: Two-letter group codes that preserve aperiodicity of inverse finite automata. Semigroup Forum\u00a076(1), 159\u2013168 (2008)","journal-title":"Semigroup Forum"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0020-0190(97)00123-3","volume":"63","author":"V. Blondel","year":"1997","unstructured":"Blondel, V., Tsitsiklis, J.: When is a pair of matrices mortal? Information Processing Letters\u00a063, 283\u2013286 (1997)","journal-title":"Information Processing Letters"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0167-6911(00)00049-9","volume":"41","author":"V. Blondel","year":"2000","unstructured":"Blondel, V., Tsitsiklis, J.: The boundedness of all products of a pair of matrices is undecidable. Systems and Control Letters\u00a041(2), 135\u2013140 (2000)","journal-title":"Systems and Control Letters"},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s00224-002-1010-5","volume":"35","author":"O. Bournez","year":"2002","unstructured":"Bournez, O., Branicky, M.: On the mortality problem for matrices of low dimensions. Theory of Computing Systems\u00a035(4), 433\u2013448 (2002)","journal-title":"Theory of Computing Systems"},{"issue":"6","key":"16_CR8","first-page":"573","volume":"29","author":"J.-Y. Cai","year":"1996","unstructured":"Cai, J.-Y., Liu, Z.: The bounded membership problem of the monoid SL2(N). Mathematical Systems Theory\u00a029(6), 573\u2013587 (1996)","journal-title":"Mathematical Systems Theory"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1051\/ita:2005007","volume":"39","author":"C. Choffrut","year":"2005","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Some decision problems on integer matrices. Informatics and Applications\u00a039, 125\u2013131 (2005)","journal-title":"Informatics and Applications"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF01752404","volume":"14","author":"M. Krom","year":"1981","unstructured":"Krom, M.: An unsolvable problem with products of matrices. Mathematical Systems Theory\u00a014, 335\u2013337 (1981)","journal-title":"Mathematical Systems Theory"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"210","DOI":"10.2307\/2690613","volume":"67","author":"M.A. Miller","year":"1994","unstructured":"Miller, M.A.: Mortality for sets of 2x2 matrices. Mathematics Magazine\u00a067(3), 210\u2013213 (1994)","journal-title":"Mathematics Magazine"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-77566-9_34","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"C. Nuccio","year":"2008","unstructured":"Nuccio, C., Rodaro, E.: Mortality Problem for 2\u00d72 Integer Matrices. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910, pp. 400\u2013405. Springer, Heidelberg (2008)"},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/sapm1970491105","volume":"49","author":"M.S. Paterson","year":"1970","unstructured":"Paterson, M.S.: Unsolvability in 3 x 3 matrices. Studies in Applied Mathematics\u00a049, 105\u2013107 (1970)","journal-title":"Studies in Applied Mathematics"},{"key":"16_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566035","volume-title":"Modular Forms and Functions","author":"R. Rankin","year":"1977","unstructured":"Rankin, R.: Modular Forms and Functions. Cambridge University Press, Cambridge (1977)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:07:59Z","timestamp":1620130079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}