{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:49:58Z","timestamp":1742964598573,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147876"},{"type":"electronic","value":"9783031147883"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14788-3_11","type":"book-chapter","created":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T14:24:42Z","timestamp":1660141482000},"page":"185-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Interpolation Algorithm for\u00a0Computing Dixon Resultants"],"prefix":"10.1007","author":[{"given":"Ayoola","family":"Jinadu","sequence":"first","affiliation":[]},{"given":"Michael","family":"Monagan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,11]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Atti, N.B., Lombardi, H., Diaz-Toca, G.M.: The Berlekamp-Massey algorithm revisited. Appli. Alebra Eng. Commun. 17(4), 75\u201382 (2006)","DOI":"10.1007\/s00200-005-0190-z"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Tiwari, P.: A deterministic algorithm for sparse multivariate polynomial interpolation.In: Proceedings of STOC 2020, pp. 301\u2013309, ACM (1988)","DOI":"10.1145\/62212.62241"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Chtcherba, A.D., Kapur, D.: On the efficiency and optimality of dixon-based resultant methods. In: Proceedings of ISSAC 2002, pp. 29\u201336, ACM (2002)","DOI":"10.1145\/780506.780511"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Cuyt, A., Lee, W.-S.: Sparse interpolation of multivariate rational functions. J. Theoretical Comp. Sci. 412, 1445\u20131456 (2011)","DOI":"10.1016\/j.tcs.2010.11.050"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Dixon, A.: On a form of the Eliminant of two quantics. Proc. Lond. Math. Soc. 2, 468\u2013478 (1908)","DOI":"10.1112\/plms\/s2-6.1.468"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Dixon, A.: The eliminant of three quantics in two independent variables. Proc. Lond. Math. Soc. 2, 49\u201369 (1909)","DOI":"10.1112\/plms\/s2-7.1.49"},{"issue":"126","key":"11_CR7","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1090\/S0025-5718-1974-0373369-7","volume":"28","author":"WM Gentleman","year":"1974","unstructured":"Gentleman, W.M., Johnson, S.C.: The evaluation of determinants by expansion by minors and the general problem of substitution. Math. Comput. 28(126), 543\u2013548 (1974)","journal-title":"Math. Comput."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Gerhard, J., Von zur Gathen, J.: Modern Computer Algebra. Cambridge University Press, New York (2013)","DOI":"10.1017\/CBO9781139856065"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Hu, J., Monagan, M.: A fast parallel sparse polynomial GCD algorithm. In: Proceedings of ISSAC 2016, pp. 271\u2013278, ACM (2016)","DOI":"10.1145\/2930889.2930903"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Kapur, D., Saxena, T.: Extraneous factors in the dixon resultant formulation. In: Proceedings of ISSAC 1997 pp. 141\u2013148, ACM (1997)","DOI":"10.1145\/258726.258768"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kapur, D., Saxena, T., Yang, L.: Algebraic and geometric reasoning using dixon resultants. In: Proceedings of ISSAC 1994, pp. 99\u2013107, ACM (1994)","DOI":"10.1145\/190347.190372"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Kapur, D., Saxena, T.: Comparison of various multivariate resultant formulations. In: Proceedings of ISSAC 1995, pp. 187\u2013194, ACM (1995)","DOI":"10.1145\/220346.220370"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Khodadad, S., Monagan, M.: Fast rational function reconstruction. In: Proceedings of ISSAC 2006, pp. 184\u2013190, ACM (2006)","DOI":"10.1145\/1145768.1145801"},{"key":"11_CR14","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-56932-1_16","volume-title":"Applications of Computer Algebra","author":"RH Lewis","year":"2017","unstructured":"Lewis, R.H.: Dixon-EDF: the premier method for solution of parametric polynomial systems. In: Kotsireas, I.S., Mart\u00ednez-Moro, E. (eds.) ACA 2015. SPMS, vol. 198, pp. 237\u2013256. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56932-1_16"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-96418-8_37","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"RH Lewis","year":"2018","unstructured":"Lewis, R.H.: Resultants, implicit parameterizations, and intersections of surfaces. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 310\u2013318. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96418-8_37"},{"key":"11_CR16","unstructured":"Lewis, R.: Private Communication"},{"key":"11_CR17","unstructured":"Lewis, R.: New Heuristics and Extensions of the Dixon Resultant for Solving Polynomial Systems, pp. 16\u201320. ACA, Montreal (2019)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Monagan, M.: Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. In: Proceedings of ISSAC 2004, pp. 243\u2013249, ACM (2004)","DOI":"10.1145\/1005285.1005321"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Monagan, M., Pearce, R.: The design of Maple\u2019s sum-of-products and POLY data structures for representing mathematical objects. Commun. Comput. Algebra 48(4), 166\u2013186, ACM (2014)","DOI":"10.1145\/2733693.2733720"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, N., Grandlund, T.: Improved division by invariant integers. Trans. Comput. 60(2), 165\u2013175, IEEE (2011)","DOI":"10.1109\/TC.2010.143"},{"key":"11_CR21","unstructured":"Storti, D.: Algebraic skeleton transform: a symbolic computation challenge, Submitted to Faculty Papers and Data, Mech. Eng. Res. Works Arch. http:\/\/hdl.handle.net\/1773\/48587"},{"key":"11_CR22","unstructured":"Tot, J.: Private Communication"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1080\/00207160.2016.1276572","volume":"94","author":"Q Xiaolin","year":"2017","unstructured":"Xiaolin, Q., Dingxiong, W., Lin, T., Zhenyi, J.: Complexity of constructing Dixon resultant matrix. Int. J. Comput. Math. 94, 2074\u20132088 (2017)","journal-title":"Int. J. Comput. Math."},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1360\/04YS0166","volume":"48","author":"S Zhao","year":"2005","unstructured":"Zhao, S., Fu, H.: An extended fast algorithm for constructing the Dixon resultant matrix. Sci. China Ser A Math. 48, 131\u2013143 (2005)","journal-title":"Sci. China Ser A Math."},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Zippel, R.: Interpolating Polynomials from their values. J. Symbol. Comput. 9, 375\u2013403 (1990)","DOI":"10.1016\/S0747-7171(08)80018-1"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14788-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T23:17:01Z","timestamp":1660259821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14788-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147876","9783031147883"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14788-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}