{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:17:21Z","timestamp":1774797441871,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1973,9,1]],"date-time":"1973-09-01T00:00:00Z","timestamp":115689600000},"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":[[1973,9]]},"DOI":"10.1007\/bf02252909","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T16:37:55Z","timestamp":1132072675000},"page":"181-196","source":"Crossref","is-referenced-by-count":15,"title":["Berechnungen in partiellen Algebren endlichen Typs","Computational complexity in partial algebras of finite type"],"prefix":"10.1007","volume":"11","author":[{"given":"V.","family":"Strassen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02252909_CR1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"Hartmanis, J., and R. E. Stearns: On the computational complexity of algorithms. Trans. AMS117, 285\u2013306 (1965).","journal-title":"Trans. AMS"},{"key":"BF02252909_CR2","unstructured":"Knuth, D. E.: The Art of Computer Programming. Vol. 2: Seminumerical Algorithms. Addison-Wesley. 1969."},{"key":"BF02252909_CR3","unstructured":"Lupanov, O. B.: \u00dcber den Schaltaufwand bei der Realisierung logischer Funktionen. Probleme der Kybernetik, Band 3."},{"key":"BF02252909_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-94694-3","volume-title":"Einf\u00fchrung in die transzendenten Zahlen","author":"Th. Schneider","year":"1957","unstructured":"Schneider, Th.: Einf\u00fchrung in die transzendenten Zahlen. Berlin-G\u00f6ttingen-Heidelberg. Springer. 1957."},{"key":"BF02252909_CR5","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF00289512","volume":"1\/4","author":"V. Strassen","year":"1972","unstructured":"Strassen, V.: Berechnung und Programm I. Acta Informatica 1\/4, 320\u2013335 (1972).","journal-title":"Acta Informatica"},{"key":"BF02252909_CR6","doi-asserted-by":"crossref","unstructured":"Munro, I., and M. Paterson: Optimal algorithms for parallel polynomial evaluation. IBM RC 3497 (#15826), August 11, 1971, Computer Sciences.","DOI":"10.1109\/SWAT.1971.23"},{"key":"BF02252909_CR7","volume-title":"Efficient Iterations for Algebraic Numbers, Proceedings of the Symposium on Complexity of Computer Computations","author":"M. S. Paterson","year":"1972","unstructured":"Paterson, M. S.: Efficient Iterations for Algebraic Numbers, Proceedings of the Symposium on Complexity of Computer Computations. Yorktown Heights, N. Y.: IBM Thomas J. Watson Research Center. 1972."},{"key":"BF02252909_CR8","series-title":"Computer Science Report","volume-title":"A bound on the multiplication efficiency of iteration","author":"H. T. Kung","year":"1972","unstructured":"Kung, H. T.: A bound on the multiplication efficiency of iteration. Computer Science Report, March, 1972. Pittsburgh, Pa.: Carnegie-Mellon University. 15213."}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252909.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02252909\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T12:47:50Z","timestamp":1683290870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02252909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1973,9]]}},"alternative-id":["BF02252909"],"URL":"https:\/\/doi.org\/10.1007\/bf02252909","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1973,9]]}}}