{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:10:57Z","timestamp":1758280257262},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002497"},{"type":"electronic","value":"9783030002503"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00250-3_7","type":"book-chapter","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T02:56:51Z","timestamp":1535597811000},"page":"87-102","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Knapsack in Hyperbolic Groups"],"prefix":"10.1007","author":[{"given":"Markus","family":"Lohrey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2681","volume":"141","author":"G Buntrock","year":"1998","unstructured":"Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Inf. Comput. 141, 1\u201336 (1998)","journal-title":"Inf. Comput."},{"key":"7_CR2","first-page":"128","volume":"18","author":"M Elberfeld","year":"2011","unstructured":"Elberfeld, M., Jakoby, A., Tantau, T.: Algorithmic meta theorems for circuit classes of constant and logarithmic depth. Electron. Colloq. Comput. Complex. (ECCC) 18, 128 (2011)","journal-title":"Electron. Colloq. Comput. Complex. (ECCC)"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1142\/S0218196706002986","volume":"16","author":"DBA Epstein","year":"2006","unstructured":"Epstein, D.B.A., Holt, D.F.: The linearity of the conjugacy problem in word-hyperbolic groups. Int. J. Algebra Comput. 16(2), 287\u2013306 (2006)","journal-title":"Int. J. Algebra Comput."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jsc.2015.05.006","volume":"74","author":"E Frenkel","year":"2016","unstructured":"Frenkel, E., Nikolaev, A., Ushakov, A.: Knapsack problems in products of groups. J. Symb. Comput. 74, 96\u2013108 (2016)","journal-title":"J. Symb. Comput."},{"key":"7_CR5","unstructured":"Ganardi, M., K\u00f6nig, D., Lohrey, M., Zetzsche, G.: Knapsack problems for wreath products. In: Proceedings of STACS 2018. LIPIcs, vol. 96, pp. 32:1\u201332:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"7_CR6","series-title":"Progress in mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9167-8","volume-title":"Sur les groupes hyperboliques d\u2019apr\u00e8s Mikhael Gromov","author":"E Ghys","year":"1990","unstructured":"Ghys, E., de La Harpe, P.: Sur les groupes hyperboliques d\u2019apr\u00e8s Mikhael Gromov. Progress in mathematics. Birkh\u00e4user, Basel (1990)"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16(2), 285\u2013296 (1966)","journal-title":"Pac. J. Math."},{"key":"7_CR8","series-title":"Mathematical Sciences Research Institute Publications","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-1-4613-9586-7_3","volume-title":"Essays in Group Theory","author":"M Gromov","year":"1987","unstructured":"Gromov, M.: Hyperbolic groups. In: Gersten, S.M. (ed.) Essays in Group Theory. MSRI, vol. 8, pp. 75\u2013263. Springer, New York (1987). https:\/\/doi.org\/10.1007\/978-1-4613-9586-7_3"},{"key":"7_CR9","unstructured":"Haase, C.: On the complexity of model checking counter automata. Ph.D. thesis, University of Oxford, St Catherine\u2019s College (2011)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1142\/S0218196700000078","volume":"10","author":"DF Holt","year":"2000","unstructured":"Holt, D.F.: Word-hyperbolic groups have real-time word problem. Int. J. Algebra Comput. 10, 221\u2013228 (2000)","journal-title":"Int. J. Algebra Comput."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"7_CR12","unstructured":"K\u00f6nig, D., Lohrey, M., Zetzsche, G.: Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. In: Algebra and Computer Science. Contemporary Mathematics, vol. 677, pp. 138\u2013153. American Mathematical Society (2016)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Kopczynski, E., To, A.W.: Parikh images of grammars: complexity and applications. In: Proceedings of LICS 2010, pp. 80\u201389. IEEE Computer Society (2010)","DOI":"10.1109\/LICS.2010.21"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1112\/blms\/bdl043","volume":"39","author":"J Lehnert","year":"2007","unstructured":"Lehnert, J., Schweitzer, P.: The co-word problem for the Higman-Thompson group is context-free. Bull. Lond. Math. Soc. 39(2), 235\u2013241 (2007)","journal-title":"Bull. Lond. Math. Soc."},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1142\/S0129054105003248","volume":"16","author":"M Lohrey","year":"2005","unstructured":"Lohrey, M.: Decidability and complexity in automatic monoids. Int. J. Found. Comput. Sci. 16(4), 707\u2013722 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR16","unstructured":"Lohrey, M., Zetzsche, G.: Knapsack in graph groups, HNN-extensions and amalgamated products. CoRR, abs\/1509.05957 (2015)"},{"key":"7_CR17","unstructured":"Lohrey, M.: Knapsack in hyperbolic groups. CoRR, abs\/1807.06774 (2018). https:\/\/arxiv.org\/abs\/1807.06774"},{"key":"7_CR18","unstructured":"Lohrey, M., Zetzsche, G.: Knapsack in graph groups, HNN-extensions and amalgamated products. In: Proceedings of STACS 2016. LIPIcs, vol. 47, pp. 50:1\u201350:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s00224-017-9808-3","volume":"62","author":"M Lohrey","year":"2018","unstructured":"Lohrey, M., Zetzsche, G.: Knapsack in graph groups. Theory Comput. Syst. 62(1), 192\u2013246 (2018)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"7_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1515\/gcc-2017-0006","volume":"9","author":"A Mishchenko","year":"2017","unstructured":"Mishchenko, A., Treier, A.: Knapsack problem for nilpotent groups. Groups Complex. Cryptol. 9(1), 87\u201398 (2017)","journal-title":"Groups Complex. Cryptol."},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1112\/jlms\/jdu034","volume":"90","author":"A Myasnikov","year":"2014","unstructured":"Myasnikov, A., Nikolaev, A.: Verbal subgroups of hyperbolic groups have infinite width. J. Lond. Math. Soc. 90(2), 573\u2013591 (2014)","journal-title":"J. Lond. Math. Soc."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1090\/S0025-5718-2014-02880-9","volume":"84","author":"A Myasnikov","year":"2015","unstructured":"Myasnikov, A., Nikolaev, A., Ushakov, A.: Knapsack problems in groups. Math. Comput. 84, 987\u20131016 (2015)","journal-title":"Math. Comput."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Ol\u2019shanskii, A.Yu.: Almost every group is hyperbolic. Int. J. Algebra Comput. 2(1), 1\u201317 (1992)","DOI":"10.1142\/S0218196792000025"},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"IH Sudborough","year":"1978","unstructured":"Sudborough, I.H.: On the tape complexity of deterministic context-free languages. J. ACM 25(3), 405\u2013414 (1978)","journal-title":"J. ACM"},{"key":"7_CR25","unstructured":"To, A.W.: Parikh images of regular languages: complexity and applications. CoRR, abs\/1002.1464 (2010). http:\/\/arxiv.org\/abs\/1002.1464"},{"key":"7_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-03927-4"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00250-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T05:50:19Z","timestamp":1571809819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00250-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002497","9783030002503"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00250-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}