{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T23:07:51Z","timestamp":1783897671902,"version":"3.55.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032222206","type":"print"},{"value":"9783032222213","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-22221-3_19","type":"book-chapter","created":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T22:57:07Z","timestamp":1783897027000},"page":"181-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimization of\u00a0Tensor Train Contraction Using Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Amelia","family":"B\u0103dic\u0103","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Costin","family":"B\u0103dic\u0103","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria","family":"Ganzha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcin","family":"Paprzycki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yutaka","family":"Watanobe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,3]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Ibrahim, C., Lykov, D., He, Z., Alexeev, Y., Safro, I.: Constructing optimal contraction trees for tensor network quantum circuit simulation. In: 2022 IEEE High Performance Extreme Computing Conference (HPEC), pp.\u00a01\u20138 (2022). https:\/\/doi.org\/10.1109\/HPEC55821.2022.9926353","DOI":"10.1109\/HPEC55821.2022.9926353"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009). https:\/\/doi.org\/10.1137\/07070111X","journal-title":"SIAM Rev."},{"issue":"5","key":"19_CR3","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011). https:\/\/doi.org\/10.1137\/090752286","journal-title":"SIAM J. Sci. Comput."},{"key":"19_CR4","unstructured":"Penrose, R.: Applications of negative dimensional tensors. In: Combinatorial Mathematics and Its Applications, pp. 221\u2013244. Academic Press, New York (1971)"},{"key":"19_CR5","unstructured":"Roberts, C., et al.: TensorNetwork: a library for physics and machine learning. CoRR abs\/1905.01330 (2019). https:\/\/arxiv.org\/abs\/1905.01330"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","DOI":"10.1088\/2632-2153\/ab94c5","volume":"1","author":"F Schindler","year":"2020","unstructured":"Schindler, F., Jermyn, A.S.: Algorithms for tensor network contraction ordering. Mach. Learn. Sci. Technol. 1(3), 035001 (2020). https:\/\/doi.org\/10.1088\/2632-2153\/ab94c5","journal-title":"Mach. Learn. Sci. Technol."},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Schwartz, O., Weiss, E.: Revisiting \u201ccomputation of matrix chain products.\u201d SIAM J. Comput. 48(5), 1481\u20131486 (2019). https:\/\/doi.org\/10.1137\/18M1195401","DOI":"10.1137\/18M1195401"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Stoian, M., Milbradt, R., Mendl, C.B.: On the optimal linear contraction order of tree tensor networks, and beyond. CoRR abs\/2209.12332 (2023). https:\/\/doi.org\/10.1137\/23m161286x","DOI":"10.1137\/23m161286x"},{"key":"19_CR9","unstructured":"Usvyatsov, M., Ballester-Ripoll, R., Schindler, K.: tntorch: tensor network learning with PyTorch. J. Mach. Learn. Res. 23(208), 1\u20136 (2022). http:\/\/jmlr.org\/papers\/v23\/21-1197.html"},{"key":"19_CR10","unstructured":"Wang, M., Pan, Y., Xu, Z., Yang, X., Li, G., Cichocki, A.: Tensor networks meet neural networks: a survey and future perspectives (2023). https:\/\/arxiv.org\/abs\/2302.09019"},{"key":"19_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.100.043309","volume":"100","author":"J Xu","year":"2019","unstructured":"Xu, J., Liang, L., Deng, L., Wen, C., Xie, Y., Li, G.: Towards a polynomial algorithm for optimal contraction sequence of tensor networks from trees. Phys. Rev. E 100, 043309 (2019). https:\/\/doi.org\/10.1103\/PhysRevE.100.043309","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22221-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T22:57:08Z","timestamp":1783897028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22221-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032222206","9783032222213"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22221-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"3 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LSSC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Large-Scale Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sozopol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lssc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/parallel.bas.bg\/Conferences\/SciCom25\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}