{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T07:13:12Z","timestamp":1776755592796,"version":"3.51.2"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1979,9,1]],"date-time":"1979-09-01T00:00:00Z","timestamp":304992000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1979,9]]},"DOI":"10.1007\/bf02253055","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T16:21:59Z","timestamp":1132071719000},"page":"221-232","source":"Crossref","is-referenced-by-count":17,"title":["Square rooting is as difficult as multiplication","Die Komplexit\u00e4t des Wurzelziehens"],"prefix":"10.1007","volume":"21","author":[{"given":"H.","family":"Alt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02253055_CR1","unstructured":"Aho, Hopcroft, Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974."},{"key":"BF02253055_CR2","unstructured":"Alt: Algorithms for Square Root Extraction. Report A 77-12, Fachbereich Angewandte Mathematik und Informatik, Saarbr\u00fccken, 1977."},{"key":"BF02253055_CR3","doi-asserted-by":"crossref","unstructured":"Spaniol: Arithmetik in Rechenanlagen. (Teubner Studienb\u00fccher, Bd. 34) 1976.","DOI":"10.1007\/978-3-322-92149-9"},{"key":"BF02253055_CR4","first-page":"2","volume":"21","author":"Ramamoorthy","year":"1972","unstructured":"Ramamoorthy, Goodman, Kim: Some Properties of Iterative Square-Rooting Methods using High-Speed Multiplication. IEEE-Transactions C21, 2 (1972).","journal-title":"IEEE-Transactions C"},{"key":"BF02253055_CR5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/0201012","volume":"1","author":"Traub","year":"1972","unstructured":"Traub: Computational Complexity of Iterative Processors. SIAM Journal of Comp.1, 167\u2013179 (1972).","journal-title":"SIAM Journal of Comp."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253055.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02253055\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02253055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T23:37:12Z","timestamp":1586561832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02253055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,9]]}},"alternative-id":["BF02253055"],"URL":"https:\/\/doi.org\/10.1007\/bf02253055","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,9]]}}}