{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:42:07Z","timestamp":1649122927477},"reference-count":3,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,7,1]],"date-time":"1980-07-01T00:00:00Z","timestamp":331257600000},"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":12069,"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":[[1980,7]]},"DOI":"10.1016\/0304-3975(80)90020-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"331-335","source":"Crossref","is-referenced-by-count":11,"title":["Some polynomials that are hard to compute"],"prefix":"10.1016","volume":"11","author":[{"given":"J.von zur","family":"Gathen","sequence":"first","affiliation":[]},{"given":"V.","family":"Strassen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90020-1_BIB1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0304-3975(80)90019-5","article-title":"Lower bounds for polynomials with algebraic coefficients","volume":"11","author":"Heintz","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(80)90020-1_BIB2","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\/divisions which are necessary to evaluate polynomials","volume":"7","author":"Schnorr","year":"1978","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0304-3975(80)90020-1_BIB3","doi-asserted-by":"crossref","first-page":"128","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. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900201?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:24:47Z","timestamp":1555125887000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,7]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,7]]}},"alternative-id":["0304397580900201"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90020-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,7]]}}}