{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:05Z","timestamp":1725663185222},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_57","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:01:23Z","timestamp":1330189283000},"page":"30-37","source":"Crossref","is-referenced-by-count":4,"title":["Functions equivalent to integer multiplication"],"prefix":"10.1007","author":[{"given":"H.","family":"Alt","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"4_CR1","unstructured":"Aho A. V., Hopcroft J. E., Ullman J. D.: \"The Design and Analysis of Computer Algorithms\" Addison-Wesley, 1974."},{"key":"4_CR2","unstructured":"Alt H.: \"Algorithms for Square Root Extraction\" Report A77\u201312, Fachbereich Angew. Mathematik und Informatik, Saarbr\u00fccken, 1977."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02253055","volume":"21","author":"H. Alt","year":"1979","unstructured":"Alt H.: \"Square Rooting is as Difficult as Multiplication\" Computing 21, 221\u2013232, (1979).","journal-title":"Computing"},{"key":"4_CR4","unstructured":"Alt H.: \"Functions Equivalent to Integer Multiplication,\" Report CS-80-8, The Pennsylvania State University, (1980)."},{"key":"4_CR5","unstructured":"Borodin A., Munroe I.: \"The Computational Complexity of Algebraic and Numeric Problems\" Elsevier Comp. Sc. Library, 1975."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1090\/S0002-9947-1969-0249212-8","volume":"142","author":"S. A. Cook","year":"1969","unstructured":"Cook S. A., Anderaa, S. O.: \"On the minimum complexity of functions\" Trans. Amer. Math. Soc. 142, 291\u2013314, (1969).","journal-title":"Trans. Amer. Math. Soc."},{"key":"4_CR7","unstructured":"Knuth D. E.: \"The Art of Computer Programming\" Vol. 2, Addison-Wesley, 1969."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00289520","volume":"1","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage A.: \"Schnelle Berechnung von Kettenbruchentwicklungen\" Acta Informatica 1, 139\u2013144, (1971).","journal-title":"Acta Informatica"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage A., Strassen V.: \"Schnelle Multiplikation grosser Zahlen\" Computing 7, 281\u2013292, (1971).","journal-title":"Computing"},{"key":"4_CR10","first-page":"714","volume":"4","author":"A. L. Toom","year":"1963","unstructured":"Toom A. L.: \"The Complexity of a Scheme of Functional Elements Realizing the Multiplication of Integers\" Soviet Math. Dokl. 4, 714\u2013716, (1963).","journal-title":"Soviet Math. Dokl."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:33:04Z","timestamp":1619555584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}