{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:22Z","timestamp":1750220902503,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T00:00:00Z","timestamp":1559174400000},"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":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2019,5,30]]},"abstract":"<jats:p>\n            We consider the problem of symbolic-numeric sparse interpolation of multivariate polynomials. The problem is to find the coefficients and the exponents of a given black-box polynomial [EQUATION] by evaluating the value of\n            <jats:italic>f<\/jats:italic>\n            (\n            <jats:italic>x<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            ,...,\n            <jats:italic>\n              x\n              <jats:sub>n<\/jats:sub>\n            <\/jats:italic>\n            ) at any point in C\n            <jats:sup>\n              <jats:italic>n<\/jats:italic>\n            <\/jats:sup>\n            in floating-point arithmetic and by using the conditions of the input.\n          <\/jats:p>","DOI":"10.1145\/3338637.3338648","type":"journal-article","created":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:37:11Z","timestamp":1559306231000},"page":"145-147","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust algorithms for sparse interpolation of multivariate polynomials"],"prefix":"10.1145","volume":"52","author":[{"given":"Dai","family":"Numahata","sequence":"first","affiliation":[{"name":"Tokyo University of Science, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Sekigawa","sequence":"additional","affiliation":[{"name":"Tokyo University of Science, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,5,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.002"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.11.003"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930924"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.11.005"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3096730.3096734"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338637.3338648","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338637.3338648","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:47Z","timestamp":1750203887000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338637.3338648"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,30]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,5,30]]}},"alternative-id":["10.1145\/3338637.3338648"],"URL":"https:\/\/doi.org\/10.1145\/3338637.3338648","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2019,5,30]]},"assertion":[{"value":"2019-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}