{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:04:11Z","timestamp":1784736251812,"version":"3.55.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T00:00:00Z","timestamp":1540944000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s11128-018-2107-3","type":"journal-article","created":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T04:17:25Z","timestamp":1540959445000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":74,"title":["Time\u2013space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2"],"prefix":"10.1007","volume":"17","author":[{"given":"Panjin","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daewan","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7988-6761","authenticated-orcid":false,"given":"Kyung Chul","family":"Jeong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"issue":"7671","key":"2107_CR1","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1038\/nature23461","volume":"549","author":"DJ Bernstein","year":"2017","unstructured":"Bernstein, D.J., Lange, T.: Post-quantum cryptography. Nature 549(7671), 188\u2013194 (2017)","journal-title":"Nature"},{"issue":"2","key":"2107_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325\u2013328 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"2107_CR3","unstructured":"Bernstein, D.J.: Cost analysis of hash collisions: Will quantum computers make SHARCS obsolete?. In: SHARCS \u201909, pp. 105\u2013116 (2009)"},{"issue":"5","key":"2107_CR4","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/s11128-018-1864-3","volume":"17","author":"M Almazrooie","year":"2018","unstructured":"Almazrooie, M., Samsudin, A., Abdullah, R., Mutter, K.N.: Quantum reversible circuit of AES-128. Quantum Inf. Process. 17(5), 112 (2018)","journal-title":"Quantum Inf. Process."},{"key":"2107_CR5","first-page":"317","volume-title":"Lecture Notes in Computer Science","author":"Matthew Amy","year":"2017","unstructured":"Amy, M., Di Matteo, O., Gheorghiu, V., Mosca, M., Parent, A., Schanck, J.: Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. In: SAC 2016, pp. 317\u2013337. ISBN: 978-3-319-69453-5 (2017)"},{"key":"2107_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-29360-8_3","volume-title":"Post-Quantum Cryptography","author":"Markus Grassl","year":"2016","unstructured":"Grassl, M., Langenberg, B., R\u00f6tteler, M., Steinwandt, R.: Applying Grover\u2019s algorithm to AES: quantum resource estimates. In: PQCrypto 2016, pp. 29\u201343. ISBN: 978-3-319-29360-8 (2016)"},{"key":"2107_CR7","unstructured":"Parent, A., R\u00f6tteler, M., Svore, K.M.: Reversible circuit compilation with space constraints. arXiv preprint \n                    arXiv:1510.00377\n                    \n                   (2015)"},{"key":"2107_CR8","doi-asserted-by":"crossref","unstructured":"R\u00f6tteler, M., Naehrig, M., Svore, K.M., Lauter, K.: Quantum resource estimates for computing elliptic curve discrete logarithms. In: ASIACRYPT 2017, pp. 241\u2013270. ISBN: 978-3-319-70697-9 (2017)","DOI":"10.1007\/978-3-319-70697-9_9"},{"key":"2107_CR9","doi-asserted-by":"crossref","unstructured":"Schwabe, P., Westerbaan, B.: Solving binary \n                    \n                      \n                    \n                    $$\\cal{MQ}$$\n                    \n                      \n                        MQ\n                      \n                    \n                   with Grover\u2019s algorithm. In: SPACE 2016, pp. 303\u2013322. ISBN: 978-3-319-49445-6 (2016)","DOI":"10.1007\/978-3-319-49445-6_17"},{"key":"2107_CR10","unstructured":"NIST: Post-quantum cryptography\u2014call for proposals (2017). \n                    https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Post-Quantum-Cryptography-Standardization\/Call-for-Proposals"},{"key":"2107_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-70697-9_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"Andr\u00e9 Chailloux","year":"2017","unstructured":"Chailloux, A., Naya-Plasencia, M., Schrottenloher, A.: An efficient quantum collision search algorithm and implications on symmetric cryptography. In: ASIACRYPT 2017, pp. 211\u2013240. ISBN: 978-3-319-70697-9. (2017)"},{"key":"2107_CR12","volume-title":"Post Quantum Cryptography","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post Quantum Cryptography, 1st edn. Springer, Berlin (2008)","edition":"1"},{"key":"2107_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 10 Anniversary edn. Cambridge University Press, Cambridge (2010)","edition":"10 Anniversary"},{"issue":"4\u20135","key":"2107_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschritte der Physik"},{"issue":"4","key":"2107_CR15","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C Zalka","year":"1999","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60(4), 2746\u20132751 (1999)","journal-title":"Phys. Rev. A"},{"key":"2107_CR16","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-79063-3_23","volume-title":"Post-Quantum Cryptography","author":"Daniel J. Bernstein","year":"2018","unstructured":"Bernstein, D.J., Yang, B.Y.: Asymptotically faster quantum algorithms to solve multivariate quadratic equations. In: PQCrypto 2018, pp. 487\u2013506. ISBN: 978-3-319-79063-3 (2018)"},{"issue":"21","key":"2107_CR17","doi-asserted-by":"publisher","first-page":"210501","DOI":"10.1103\/PhysRevLett.113.210501","volume":"113","author":"TJ Yoder","year":"2014","unstructured":"Yoder, T.J., Low, G.H., Chuang, I.L.: Fixed-point quantum search with an optimal number of queries. Phys. Rev. Lett. 113(21), 210501 (2014)","journal-title":"Phys. Rev. Lett."},{"key":"2107_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. AMS Contemp. Math. 305, 53\u201374 (2002)","journal-title":"AMS Contemp. Math."},{"key":"2107_CR19","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0054319","volume-title":"LATIN'98: Theoretical Informatics","author":"Gilles Brassard","year":"1998","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: LATIN \u201998, pp. 163\u2013169. ISBN: 978-3-540-69715-2 (1998)"},{"key":"2107_CR20","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-319-70697-9_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"Akinori Hosoyamada","year":"2017","unstructured":"Hosoyamada, A., Sasaki, Y., Xagawa, K.: Quantum multicollision-finding algorithm. In: ASIACRYPT 2017, pp. 179\u2013210. ISBN: 978-3-319-70697-9 (2017)"},{"issue":"12","key":"2107_CR21","doi-asserted-by":"publisher","first-page":"123010","DOI":"10.1088\/1367-2630\/17\/12\/123010","volume":"17","author":"S Arunachalam","year":"2015","unstructured":"Arunachalam, S., Gheorghiu, V., Jochym-O\u2019Connor, T., Mosca, M., Srinivasan, P.V.: On the robustness of bucket brigade quantum RAM. New J. Phys. 17(12), 123010 (2015)","journal-title":"New J. Phys."},{"issue":"5","key":"2107_CR22","doi-asserted-by":"publisher","first-page":"052307","DOI":"10.1103\/PhysRevA.67.052307","volume":"67","author":"N Shenvi","year":"2003","unstructured":"Shenvi, N., Kempe, J., Whaley, K.B.: Quantum random-walk search algorithm. Phys. Rev. A 67(5), 052307 (2003)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"2107_CR23","doi-asserted-by":"publisher","first-page":"022314","DOI":"10.1103\/PhysRevA.70.022314","volume":"70","author":"AM Childs","year":"2004","unstructured":"Childs, A.M., Goldstone, J.: Spatial search by quantum walk. Phys. Rev. A 70(2), 022314 (2004)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"2107_CR24","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539705447311","volume":"37","author":"A Ambainis","year":"2007","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210\u2013239 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2107_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC Oorschot van","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. J. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."},{"key":"2107_CR26","unstructured":"NIST: Advanced Encryption Standard (AES), FIPS PUB 197 (2001)"},{"key":"2107_CR27","unstructured":"NIST: Secure Hash Standard (SHS), FIPS PUB 180-4 (2015)"},{"issue":"7 & 8","key":"2107_CR28","first-page":"649","volume":"14","author":"A Pavlidis","year":"2014","unstructured":"Pavlidis, A., Gizopoulos, D.: Fast quantum modular exponentiation architecture for Shor\u2019s factoring algorithm. Quantum Inf. Comput. 14(7 & 8), 649\u2013682 (2014)","journal-title":"Quantum Inf. Comput."},{"key":"2107_CR29","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Odlyzko, A.M.: Random mapping statistics. In: EUROCRYPT \u201989, pp. 329\u2013354. Springer, Berlin Heidelberg. ISBN: 978-3-540-46885-1 (1990)","DOI":"10.1007\/3-540-46885-4_34"},{"key":"2107_CR30","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2007","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography, 2nd edn. Chapman & Hall\/CRC, London (2007)","edition":"2"},{"issue":"7 & 8","key":"2107_CR31","first-page":"673","volume":"17","author":"T H\u00e4ner","year":"2017","unstructured":"H\u00e4ner, T., R\u00f6tteler, M., Svore, K.M.: Factoring using \n                    \n                      \n                    \n                    $$2n+2$$\n                    \n                      \n                        \n                          2\n                          n\n                          +\n                          2\n                        \n                      \n                    \n                   qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 17(7 & 8), 673 (2017)","journal-title":"Quantum Inf. Comput."},{"key":"2107_CR32","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52, 3457\u20133467 (1995)","journal-title":"Phys. Rev. A"},{"issue":"1868","key":"2107_CR33","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1098\/rspa.1989.0099","volume":"425","author":"D Deutsch","year":"1989","unstructured":"Deutsch, D.: Quantum computational networks. Proc. R. Soc. Lond. A 425(1868), 73\u201390 (1989)","journal-title":"Proc. R. Soc. Lond. A"},{"issue":"1","key":"2107_CR34","first-page":"84","volume":"3","author":"Y Shi","year":"2003","unstructured":"Shi, Y.: Both Toffoli and controlled-NOT need little help to do universal quantum computing. Quantum Inf. Comput. 3(1), 84\u201392 (2003)","journal-title":"Quantum Inf. Comput."},{"key":"2107_CR35","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-10003-2_104","volume-title":"Automata, Languages and Programming","author":"T Toffoli","year":"1980","unstructured":"Toffoli, T.: Reversible computing. In: de Bakker, J., van Leeuwen, J. (eds.) Automata, Languages and Programming, pp. 632\u2013644. Springer, Berlin Heidelberg (1980)"},{"key":"2107_CR36","unstructured":"Gottesman, D.: The Heisenberg representation of quantum computers. In: GP22: ICGTMP \u201998, pp. 32\u201343 (1998)"},{"issue":"5","key":"2107_CR37","doi-asserted-by":"publisher","first-page":"052328","DOI":"10.1103\/PhysRevA.70.052328","volume":"70","author":"S Aaronson","year":"2004","unstructured":"Aaronson, S., Gottesman, D.: Improved simulation of stabilizer circuits. Phys. Rev. A 70(5), 052328 (2004)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"2107_CR38","doi-asserted-by":"publisher","first-page":"032324","DOI":"10.1103\/PhysRevA.86.032324","volume":"86","author":"AG Fowler","year":"2012","unstructured":"Fowler, A.G., Mariantoni, M., Martinis, J.M., Cleland, A.N.: Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86(3), 032324 (2012)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"2107_CR39","first-page":"031007","volume":"2","author":"NC Jones","year":"2012","unstructured":"Jones, N.C., Van Meter, R., Fowler, A.G., McMahon, P.L., Kim, J., Ladd, T.D., Yamamoto, Y.: Layered architecture for quantum computing. Phys. Rev. X 2(3), 031007 (2012)","journal-title":"Phys. Rev. X"},{"issue":"3","key":"2107_CR40","doi-asserted-by":"publisher","first-page":"032338","DOI":"10.1103\/PhysRevA.95.032338","volume":"95","author":"J O\u2019Gorman","year":"2017","unstructured":"O\u2019Gorman, J., Campbell, E.T.: Quantum computation with realistic magic-state factories. Phys. Rev. A 95(3), 032338 (2017)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"2107_CR41","doi-asserted-by":"publisher","first-page":"022316","DOI":"10.1103\/PhysRevA.71.022316","volume":"71","author":"S Bravyi","year":"2005","unstructured":"Bravyi, S., Kitaev, A.: Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71(2), 022316 (2005)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"2107_CR42","doi-asserted-by":"publisher","first-page":"052329","DOI":"10.1103\/PhysRevA.86.052329","volume":"86","author":"S Bravyi","year":"2012","unstructured":"Bravyi, S., Haah, J.: Magic-state distillation with low overhead. Phys. Rev. A 86(5), 052329 (2012)","journal-title":"Phys. Rev. A"},{"issue":"4","key":"2107_CR43","doi-asserted-by":"publisher","first-page":"042305","DOI":"10.1103\/PhysRevA.87.042305","volume":"87","author":"C Jones","year":"2013","unstructured":"Jones, C.: Multilevel distillation of magic states for quantum computing. Phys. Rev. A 87(4), 042305 (2013)","journal-title":"Phys. Rev. A"},{"issue":"3\u20134","key":"2107_CR44","first-page":"195","volume":"13","author":"AM Meier","year":"2013","unstructured":"Meier, A.M., Eastin, B., Knill, E.: Magic-state distillation with the four-qubit code. Quantum Inf. Comput. 13(3\u20134), 195\u2013209 (2013)","journal-title":"Quantum Inf. Comput."},{"issue":"7\u20138","key":"2107_CR45","first-page":"631","volume":"13","author":"B Amento","year":"2013","unstructured":"Amento, B., R\u00f6tteler, M., Steinwandt, R.: Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity. Quantum Inf. Comput. 13(7\u20138), 631\u2013644 (2013)","journal-title":"Quantum Inf. Comput."},{"issue":"6","key":"2107_CR46","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., R\u00f6tteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"19","key":"2107_CR47","doi-asserted-by":"publisher","first-page":"190501","DOI":"10.1103\/PhysRevLett.109.190501","volume":"109","author":"A Bocharov","year":"2012","unstructured":"Bocharov, A., Svore, K.M.: Resource-optimal single-qubit quantum circuits. Phys. Rev. Lett. 109(19), 190501 (2012)","journal-title":"Phys. Rev. Lett."},{"issue":"15\u201316","key":"2107_CR48","first-page":"1261","volume":"14","author":"D Gosset","year":"2014","unstructured":"Gosset, D., Kliuchnikov, V., Mosca, M., Russo, V.: An algorithm for the T-count. Quantum Inf. Comput. 14(15\u201316), 1261\u20131276 (2014)","journal-title":"Quantum Inf. Comput."},{"key":"2107_CR49","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-44678-8_4","volume-title":"Quantum Information: An Introduction to Basic Theoretical Concepts and Experiments","author":"T Beth","year":"2001","unstructured":"Beth, T., R\u00f6tteler, M.: Quantum algorithms: applicable algebra and quantum physics. In: Alber, G. (ed.) Quantum Information: An Introduction to Basic Theoretical Concepts and Experiments, pp. 96\u2013150. Springer, Berlin Heidelberg (2001)"},{"issue":"3","key":"2107_CR50","first-page":"282","volume":"8","author":"KN Patel","year":"2008","unstructured":"Patel, K.N., Markov, I.L., Hayes, J.P.: Optimal synthesis of linear reversible circuits. Quantum Inf. Comput. 8(3), 282\u2013294 (2008)","journal-title":"Quantum Inf. Comput."},{"issue":"7","key":"2107_CR51","first-page":"610","volume":"9","author":"D Maslov","year":"2009","unstructured":"Maslov, D., Mathew, J., Cheung, D., Pradhan, D.K.: An O\n                    \n                      \n                    \n                    $$(m^2)$$\n                    \n                      \n                        \n                          (\n                          \n                            m\n                            2\n                          \n                          )\n                        \n                      \n                    \n                  -depth quantum algorithm for the elliptic curve discrete logarithm problem over GF\n                    \n                      \n                    \n                    $$(2^m)^a$$\n                    \n                      \n                        \n                          \n                            (\n                            \n                              2\n                              m\n                            \n                            )\n                          \n                          a\n                        \n                      \n                    \n                  . Quantum Inf. Comput. 9(7), 610\u2013621 (2009)","journal-title":"Quantum Inf. Comput."},{"issue":"14","key":"2107_CR52","doi-asserted-by":"publisher","first-page":"147902","DOI":"10.1103\/PhysRevLett.91.147902","volume":"91","author":"G Vidal","year":"2003","unstructured":"Vidal, G.: Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91(14), 147902 (2003)","journal-title":"Phys. Rev. Lett."},{"issue":"7","key":"2107_CR53","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1007\/s11128-015-0993-1","volume":"14","author":"S Kepley","year":"2015","unstructured":"Kepley, S., Steinwandt, R.: Quantum circuits for \n                    \n                      \n                    \n                    $$\\mathbb{F}_{2^n}$$\n                    \n                      \n                        \n                          F\n                          \n                            2\n                            n\n                          \n                        \n                      \n                    \n                  -multiplication with subquadratic gate count. Quantum Inf. Process. 14(7), 2373\u20132386 (2015)","journal-title":"Quantum Inf. Process."},{"key":"2107_CR54","unstructured":"Cuccaro, S.A., Draper, T.G., Kutin, S.A., Moulton, D.P.: A new quantum ripple-carry addition circuit. arXiv preprint \n                    arXiv:quant-ph\/0410184\n                    \n                   (2004)"},{"issue":"4 & 5","key":"2107_CR55","first-page":"351","volume":"6","author":"TG Draper","year":"2006","unstructured":"Draper, T.G., Kutin, S.A., Rains, E.M., Svore, K.M.: A logarithmic-depth quantum carry-lookahead adder. Quantum Inf. Comput. 6(4 & 5), 351\u2013369 (2006)","journal-title":"Quantum Inf. Comput."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-018-2107-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-2107-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-2107-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T12:19:02Z","timestamp":1576498742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-018-2107-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,31]]},"references-count":55,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["2107"],"URL":"https:\/\/doi.org\/10.1007\/s11128-018-2107-3","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,31]]},"assertion":[{"value":"30 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"339"}}