{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:22:27Z","timestamp":1758709347383,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T00:00:00Z","timestamp":1307491200000},"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":[],"published-print":{"date-parts":[[2011,6,8]]},"DOI":"10.1145\/1993886.1993916","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"177-186","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Supersparse black box rational function interpolation"],"prefix":"10.1145","author":[{"given":"Erich L.","family":"Kaltofen","sequence":"first","affiliation":[{"name":"NCSU, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Nehring","sequence":"additional","affiliation":[{"name":"NCSU, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0607059"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1998.0242"},{"key":"e_1_3_2_1_4_1","volume-title":"Irreducibility and greatest common divisor algorithms for sparse polynomials","author":"Filaseta M.","year":"2007","unstructured":"Filaseta , M. , Granville , A. , and Schinzel , A . Irreducibility and greatest common divisor algorithms for sparse polynomials , 2007 . Manuscript submitted. Filaseta, M., Granville, A., and Schinzel, A. Irreducibility and greatest common divisor algorithms for sparse polynomials, 2007. Manuscript submitted."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.030"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(03)00087-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0294-0"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390768.1390785"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.08.006"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17517-6_25"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100054657"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-64.2.265"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/42267.45069"},{"key":"e_1_3_2_1_14_1","volume-title":"Unpublished article fragment","author":"Kaltofen E.","year":"1988","unstructured":"Kaltofen , E. Unpublished article fragment , 1988 . URL http:\/\/www.math.ncsu.edu\/~kaltofen\/bibliography\/88\/Ka88_ratint.pdf. Kaltofen, E. Unpublished article fragment, 1988. URL http:\/\/www.math.ncsu.edu\/~kaltofen\/bibliography\/88\/Ka88_ratint.pdf."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837210.1837213"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145798"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(03)00088-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80015-6"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0185-3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277548.1277577"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277500.1277503"},{"key":"e_1_3_2_1_22_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Proc. CRYPTO '99","author":"Kipnis A.","year":"1999","unstructured":"Kipnis , A. , and Shamir , A . Cryptanalysis of the HFE public key cryptosystem by relinearization . In Proc. CRYPTO '99 ( 1999 ), M. J. Wiener, Ed ., vol. 1666 of Lecture Notes in Computer Science , Springer , pp. 19 -- 30 . Kipnis, A., and Shamir, A. Cryptanalysis of the HFE public key cryptosystem by relinearization. In Proc. CRYPTO '99 (1999), M. J. Wiener, Ed., vol. 1666 of Lecture Notes in Computer Science, Springer, pp. 19--30."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1515\/9783110285581.267","volume-title":"Number Theory in Progress","author":"Lenstra Jr., H. W.","year":"1999","unstructured":"Lenstra , Jr., H. W. Finding small degree factors of lacunary polynomials . In Number Theory in Progress ( 1999 ), K. Gy\\Hory, H. Iwaniec, and J. Urbanowicz, Eds., vol. 1 Diophantine Problems and Polynomials, Stefan Banach Internat. Center, Walter de Gruyter Berlin\/New York , pp. 267 -- 276 . Lenstra, Jr., H. W. Finding small degree factors of lacunary polynomials. In Number Theory in Progress (1999), K. Gy\\Hory, H. Iwaniec, and J. Urbanowicz, Eds., vol. 1 Diophantine Problems and Polynomials, Stefan Banach Internat. Center, Walter de Gruyter Berlin\/New York, pp. 267--276."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.21099\/tkbjm\/1496164216"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812778857_0008"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90130-0"},{"key":"e_1_3_2_1_27_1","volume-title":"An improved algorithm for computing logarithms over GF(p) and its cryptographic significance","author":"Pohlig C. P.","year":"1978","unstructured":"Pohlig , C. P. , and Hellman , M. E . An improved algorithm for computing logarithms over GF(p) and its cryptographic significance . IEEE Trans. Inf. Theory shape it-24 ( 1978 ), 106--110. Pohlig, C. P., and Hellman, M. E. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theory shape it-24 (1978), 106--110."}],"event":{"name":"ISSAC '11: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"San Jose California USA","acronym":"ISSAC '11"},"container-title":["Proceedings of the 36th international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993886.1993916","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993886.1993916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:47Z","timestamp":1750244747000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993886.1993916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,8]]},"references-count":27,"alternative-id":["10.1145\/1993886.1993916","10.1145\/1993886"],"URL":"https:\/\/doi.org\/10.1145\/1993886.1993916","relation":{},"subject":[],"published":{"date-parts":[[2011,6,8]]},"assertion":[{"value":"2011-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}