{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:04:56Z","timestamp":1760727896153},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8873,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,4]]},"DOI":"10.1016\/0304-3975(89)90093-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"1-13","source":"Crossref","is-referenced-by-count":11,"title":["On the representation of rational functions of bounded complexity"],"prefix":"10.1016","volume":"64","author":[{"given":"Hans-J\u00f6rg","family":"Sto\u00df","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90093-5_BIB1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0205013","article-title":"On the number of additions to compute specific polynomials","volume":"5","author":"Borodin","year":"1976","journal-title":"SIAM J. Comp."},{"year":"1975","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","key":"10.1016\/0304-3975(89)90093-5_BIB2"},{"key":"10.1016\/0304-3975(89)90093-5_BIB3","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(80)90020-1","article-title":"Some polynomials that are hard to compute","volume":"11","author":"Von zur Gathen","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90093-5_BIB4","doi-asserted-by":"crossref","unstructured":"J. Heintz, Private communication (1984).","DOI":"10.1111\/j.1432-1033.1984.tb08048.x"},{"key":"10.1016\/0304-3975(89)90093-5_BIB5","first-page":"262","article-title":"Testing polynomials which are easy to compute","author":"Heintz","year":"1980","journal-title":"Proc. 12th Ann. ACM Symp. on Computing"},{"key":"10.1016\/0304-3975(89)90093-5_BIB6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0304-3975(80)90019-5","article-title":"A new method to show lower bounds for polynomials which are hard to compute","volume":"11","author":"Heintz","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90093-5_BIB7","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/0202007","article-title":"On the number of nonscalar multiplications necessary to evaluate polynomials","volume":"2","author":"Paterson","year":"1973","journal-title":"SIAM J. Comp."},{"key":"10.1016\/0304-3975(89)90093-5_BIB8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(78)90016-6","article-title":"Improved lower bounds on the number of multiplications\u29f8divisions which are necessary to evaluate polynomials","volume":"7","author":"Schnorr","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90093-5_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(80)90068-7","article-title":"On the additive complexity of polynomials","volume":"10","author":"Schnorr","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90093-5_BIB10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0304-3975(89)90094-7","article-title":"Lower bounds on the complexity of polynomials","volume":"64","author":"Sto\u00df","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90093-5_BIB11","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF00289512","article-title":"Berechnung und Programm I","volume":"1","author":"Strassen","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(89)90093-5_BIB12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/0203010","article-title":"Polynomials with rational coefficients which are hard to compute","volume":"3","author":"Strassen","year":"1974","journal-title":"SIAM J. Comp."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900935?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900935?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:37Z","timestamp":1555127737000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0304397589900935"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90093-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}