{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T17:30:43Z","timestamp":1751477443570,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[1981,8,1]],"date-time":"1981-08-01T00:00:00Z","timestamp":365472000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSAM Bull."],"published-print":{"date-parts":[[1981,8]]},"abstract":"<jats:p>Methods are presented for taking powers of symbolic polynomials and substituting them into univariate polynomials with scalar coefficients. It is shown that the size of the result is a sharp lower bound on the number of coefficient multiplications required to raise a completely sparse polynomial to a power. Other theoretical results prove the optimality or near-optimality of the methods given, in terms of numbers of coefficient operations, under the condition of complete sparsity of the argument.<\/jats:p>","DOI":"10.1145\/1089263.1089266","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"17-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient polynomial substitutions of a sparse argument"],"prefix":"10.1145","volume":"15","author":[{"given":"William H.","family":"Rowan","sequence":"first","affiliation":[{"name":"U.C. Berkeley"}]}],"member":"320","published-online":{"date-parts":[[1981,8]]},"reference":[{"unstructured":"(AL 77) Alagar Vangalur A. and Probst D.: \"Binomial-expansion algorithms for computing integer powers of sparse polynomials \" International Computing Symposium 1977 E. Morlet and D. Ribbins eds. North Holland Amsterdam (1977) pp. 395--402.  (AL 77) Alagar Vangalur A. and Probst D.: \"Binomial-expansion algorithms for computing integer powers of sparse polynomials \" International Computing Symposium 1977 E. Morlet and D. Ribbins eds. North Holland Amsterdam (1977) pp. 395--402.","key":"e_1_2_1_1_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1137\/0203016"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1002\/sapm1974532145"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1090\/S0025-5718-1972-0314303-3"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_1","DOI":"10.1145\/800205.806332"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1137\/0208050"}],"container-title":["ACM SIGSAM Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089263.1089266","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1089263.1089266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:22Z","timestamp":1750262902000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089263.1089266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,8]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,8]]}},"alternative-id":["10.1145\/1089263.1089266"],"URL":"https:\/\/doi.org\/10.1145\/1089263.1089266","relation":{},"ISSN":["0163-5824"],"issn-type":[{"type":"print","value":"0163-5824"}],"subject":[],"published":{"date-parts":[[1981,8]]},"assertion":[{"value":"1981-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}