{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:49:26Z","timestamp":1767192566074},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_16","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T04:35:54Z","timestamp":1513744554000},"page":"227-242","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sparse Rational Function Interpolation with Finitely Many Values for the Coefficients"],"prefix":"10.1007","author":[{"given":"Qiao-Long","family":"Huang","sequence":"first","affiliation":[]},{"given":"Xiao-Shan","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"issue":"16","key":"16_CR1","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1016\/j.tcs.2010.11.050","volume":"412","author":"A Cuyt","year":"2011","unstructured":"Cuyt, A., Lee, W.S.: Sparse interpolation of multivariate rational functions. Theor. Comput. Sci. 412(16), 1445\u20131456 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"16_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539791194069","volume":"23","author":"D Grigoriev","year":"1994","unstructured":"Grigoriev, D., Karpinski, M., Singer, M.F.: Computational complexity of sparse rational interpolation. SIAM J. Comput. 23(1), 1\u201311 (1994)","journal-title":"SIAM J. Comput."},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-319-66320-3_15","volume-title":"Computer Algebra in Scientific Computing","author":"Q-L Huang","year":"2017","unstructured":"Huang, Q.-L., Gao, X.-S.: Sparse polynomial interpolation with finitely many values for the coefficients. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2017. LNCS, vol. 10490, pp. 196\u2013209. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66320-3_15"},{"key":"16_CR4","unstructured":"Huang, Q.L., Gao, X.S.: Sparse rational function interpolation with finitely many values for the coefficients (2017). \narXiv:1706.00914"},{"key":"16_CR5","unstructured":"Huang, Q.L., Gao, X.S.: Sparse interpolation of black-box multivariate polynomials using Kronecker type substitutions (2017). \narXiv:1710.01301"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/42267.45069","volume":"35","author":"E Kaltofen","year":"1988","unstructured":"Kaltofen, E.: Greatest common divisors of polynomials given by straight-line programs. J. ACM 35, 231\u2013264 (1988)","journal-title":"J. ACM"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0747-7171(08)80015-6","volume":"9","author":"E Kaltofen","year":"1990","unstructured":"Kaltofen, E., Trager, B.: Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators. J. Symbolic Comput. 9, 301\u2013320 (1990)","journal-title":"J. Symbolic Comput."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Yang, Z.: On exact and approximate interpolation of sparse rational functions. In: Proceedings of ISSAC 2007. ACM Press, pp. 203\u2013210 (2007)","DOI":"10.1145\/1277548.1277577"},{"key":"16_CR9","unstructured":"Kronecker, L.: Grundz\n            $$\\ddot{u}$$\n            \n              \n                \n                  u\n                  \u00a8\n                \n              \n            \n          ge einer arithmetischen Theorie der algebraischen Gr\n            $$\\ddot{o}$$\n            \n              \n                \n                  o\n                  \u00a8\n                \n              \n            \n          ssen. J. f\n            $$\\ddot{u}$$\n            \n              \n                \n                  u\n                  \u00a8\n                \n              \n            \n          r die Reine und Angewandte Mathematik 92, 1\u2013122 (1882)"},{"key":"16_CR10","volume-title":"Modern Computer Algebra","author":"J Gathen von zur","year":"1999","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, New York (1999)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T04:42:41Z","timestamp":1513744961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}