{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:40:01Z","timestamp":1740001201964,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638902"},{"type":"electronic","value":"9783540696629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63890-3_6","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T21:12:11Z","timestamp":1270501931000},"page":"42-51","source":"Crossref","is-referenced-by-count":5,"title":["Formulation of the addition-shift-sequence problem and its complexity"],"prefix":"10.1007","author":[{"given":"Akihiro","family":"Matsuura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Nagoya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"6_CR1","first-page":"41","volume":"47","author":"A. Scholz","year":"1937","unstructured":"A. Scholz, \u201cAufgabe 253\u201d, Jahresbericht der deutchen Mathematiker-Vereinigung, 47, pp. 41\u201342 (1937).","journal-title":"Jahresbericht der deutchen Mathematiker-Vereinigung"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1090\/S0002-9904-1939-07068-7","volume":"45","author":"A. Brauer","year":"1939","unstructured":"A. Brauer, \u201cOn addition chains\u201d, Bull. Amer. Math. Soc., 45, pp. 736\u2013739 (1939).","journal-title":"Bull. Amer. Math. Soc."},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(75)90008-0","volume":"1","author":"A. Sch\u00f6nhage","year":"1975","unstructured":"A. Sch\u00f6nhage, \u201cA lower bound for the length of addition chains\u201d, Theoret. Comp. Sci., 1, pp. 1\u201312 (1975).","journal-title":"Theoret. Comp. Sci."},{"issue":"1","key":"6_CR4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0205008","volume":"5","author":"A. Yao","year":"1976","unstructured":"A. Yao, \u201cOn the evaluation of powers\u201d, SIAM J. Computing, vol. 5, no. 1, pp. 100\u2013103 (1976).","journal-title":"SIAM J. Computing"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0210047","volume":"3","author":"P. Downey","year":"1981","unstructured":"P. Downey, B. Leong and R. Sethi, \u201cComputing sequences with addition chains\u201d, SIAM J. Computing, 3, pp. 638\u2013696 (1981).","journal-title":"SIAM J. Computing"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"J. Bos and M. Coster, \u201cAddition Chain Heuristics\u201d, Proc. CRYPTO'89, pp. 400-407 (1989).","DOI":"10.1007\/0-387-34805-0_37"},{"issue":"1","key":"6_CR7","first-page":"34","volume":"E80-A","author":"Y. Tsuruoka","year":"1997","unstructured":"Y. Tsuruoka and K. Koyama, \u201cFast Exponentiation Algorithms Based on Batch-Processing and Precomputation\u201d, IEICE Trans. Fundamentals, vol.E80-A, no. 1, pp. 34\u201339 (Jan. 1997).","journal-title":"IEICE Trans. Fundamentals"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"M. Potkonjak, M. B. Srivastava and A. P. Chandrakasan, \u201cEfficient substitution of multiple constant multiplications by shifts and additions using iterative pairwise matching\u201d, ACM\/IEEE Proc. 31st DAC, pp. 189\u2013194 (1994).","DOI":"10.1145\/196244.196343"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"M. Mehendale, S. D. Shelekar and G. Venkatesh, \u201cSynthesis of Multiplier-less FIR Filters with Minimum Number of Additions\", Proc. ICCAD'95, pp. 668\u2013671 (1995).","DOI":"10.1109\/ICCAD.1995.480201"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"A. Matsuura, M. Yukishita and A. Nagoya, ldAn Efficient Hierarchical Clustering Method for the Multiple Constant Multiplication Problem\u201d, Proc. ASP-DAC'97, pp. 83\u201388 (1997).","DOI":"10.1109\/ASPDAC.1997.600064"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp, \u201cReducibility among combinatorial problems\u201d, In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, pp. 85\u2013103 (1972)."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63890-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:22:08Z","timestamp":1740000128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63890-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638902","9783540696629"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-63890-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}