{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:23Z","timestamp":1760061563892},"reference-count":23,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3607,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0747-7171(03)00084-1","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T16:18:16Z","timestamp":1058372296000},"page":"289-315","source":"Crossref","is-referenced-by-count":12,"title":["Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation"],"prefix":"10.1016","volume":"36","author":[{"given":"Arthur D.","family":"Chtcherba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"Kapur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(03)00084-1_B1","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/337244.337247","article-title":"A subdivision based algorithm for the sparse resultant","volume":"47","author":"Canny","year":"2000","journal-title":"J. ACM"},{"key":"10.1016\/S0747-7171(03)00084-1_B2","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1006\/jsco.2001.0448","article-title":"Rectangular corner cutting and dixon A-resultants","volume":"31","author":"Chionh","year":"2001","journal-title":"J. Symbolic Comput"},{"key":"10.1016\/S0747-7171(03)00084-1_B3","unstructured":"Chtcherba, A.D., 2003. A new Sylvester-type resultant method based on the Dixon\u2013B\u00e9zout formulation, Ph.D. Dissertation. University of New Mexico, Department of Computer Science"},{"key":"10.1016\/S0747-7171(03)00084-1_B4","doi-asserted-by":"crossref","unstructured":"Chtcherba, A.D., Kapur, D., 2000a. Conditions for Exact Resultants Using the Dixon Formulation. Proc. of ISSAC, ACM Press, St. Andrews, Scotland, 2000. pp.\u00a062\u201370","DOI":"10.1145\/345542.345583"},{"key":"10.1016\/S0747-7171(03)00084-1_B5","unstructured":"Chtcherba, A.D., Kapur, D., 2000b. Extracting sparse resultant matrices from the Dixon resultant formultation. In: RCWA\u201900, Proceedings of 7th Rhine Workshop, pp.\u00a0167\u2013182"},{"key":"10.1016\/S0747-7171(03)00084-1_B6","unstructured":"Chtcherba, A.D., Kapur, D., 2002a. Constructing Sylvester-type resultant matrices using Dixon formulation. Technical Report TR-CS-2002-16. Department of Computer Science, University of New Mexico, Albuquerque, New Mexico, USA"},{"key":"10.1016\/S0747-7171(03)00084-1_B7","series-title":"RCWA\u201902, Proceedings of 8th Rhine Workshop","first-page":"137","article-title":"A complete analysis of resultants and extraneous factors for unmixed bivariate polynomial systems using the Dixon formulation","author":"Chtcherba","year":"2002"},{"key":"10.1016\/S0747-7171(03)00084-1_B8","unstructured":"Chtcherba, A.D., Kapur, D. 2002c. Resultants for unmixed bivariate polynomial systems using the Dixon formulation. Technical Report No. TR-CS-2002-15. Department of Computer Science, University of New Mexico. J. Symbolic Comput. (submitted for publication)"},{"key":"10.1016\/S0747-7171(03)00084-1_B9","doi-asserted-by":"crossref","unstructured":"Chtcherba, A.D., Kapur, D. 2002d. On the efficiency and optimality of Dixon-based resultant methods. Proc. of ISSAC, Lille, France, 2002","DOI":"10.1145\/780506.780511"},{"key":"10.1016\/S0747-7171(03)00084-1_B10","doi-asserted-by":"crossref","unstructured":"Chtcherba, A.D., Kapur, D., 2003. On relationship between the Dixon-based resultant construction and the supports of polynomial systems. Technical Report. Department of Computer Science, University of New Mexico, Albuquerque, New Mexico, USA (in press)","DOI":"10.1145\/990353.990358"},{"key":"10.1016\/S0747-7171(03)00084-1_B11","series-title":"Using Algebraic Geometry","author":"Cox","year":"1998"},{"key":"10.1016\/S0747-7171(03)00084-1_B12","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1112\/plms\/s2-6.1.468","article-title":"The eliminant of three quantics in two independent variables","volume":"6","author":"Dixon","year":"1908","journal-title":"Proc. London Math. Soc"},{"issue":"1\u20132","key":"10.1016\/S0747-7171(03)00084-1_B13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jsco.1998.0266","article-title":"Matrices in elimination theory","volume":"28","author":"Emiris","year":"1999","journal-title":"J. Symbolic Comput"},{"key":"10.1016\/S0747-7171(03)00084-1_B14","series-title":"Discriminants, Resultants and Multidimensional Determinants","author":"Gelfand","year":"1994"},{"key":"10.1016\/S0747-7171(03)00084-1_B15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1215\/S0012-7094-92-06707-X","article-title":"Chow polytopes and general resultants","volume":"67","author":"Kapranov","year":"1992","journal-title":"Duke Math. J"},{"key":"10.1016\/S0747-7171(03)00084-1_B16","series-title":"ACM ISSAC 94","first-page":"99","article-title":"Algebraic and geometric reasoning using the Dixon resultants","author":"Kapur","year":"1994"},{"key":"10.1016\/S0747-7171(03)00084-1_B17","series-title":"ACM ISSAC 95","article-title":"Comparison of various multivariate resultants","author":"Kapur","year":"1995"},{"key":"10.1016\/S0747-7171(03)00084-1_B18","doi-asserted-by":"crossref","unstructured":"Kapur, D., Saxena, T., 1996. Sparsity considerations in the Dixon resultant formulation. In: Proc. ACM Symposium on Theory of Computing, Philadelphia","DOI":"10.1145\/237814.237862"},{"key":"10.1016\/S0747-7171(03)00084-1_B19","series-title":"ISSAC","first-page":"141","article-title":"Extraneous factors in the Dixon resultant formulation","author":"Kapur","year":"1997"},{"key":"10.1016\/S0747-7171(03)00084-1_B20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0096-3003(87)90063-4","article-title":"A homotopy for solving general polynomial systems that respects m-homogeneous structures","volume":"24","author":"Morgan","year":"1987","journal-title":"Appl. Math. Comput"},{"key":"10.1016\/S0747-7171(03)00084-1_B21","unstructured":"Saxena, T., 1997. Efficient variable elimination using resultants, Ph.D. Thesis. Department of Computer Science, State Univeristy of New York, Albany, NY"},{"key":"10.1016\/S0747-7171(03)00084-1_B22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1006\/jabr.1994.1007","article-title":"Multigraded resultants of Sylvester type","volume":"163","author":"Sturmfels","year":"1994","journal-title":"J. Algebra"},{"key":"10.1016\/S0747-7171(03)00084-1_B23","series-title":"Proceedings of the ISSAC","first-page":"301","article-title":"Rectangular corner cutting and Sylvester A-resultants","author":"Zhang","year":"2000"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717103000841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717103000841?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T18:26:48Z","timestamp":1585074408000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717103000841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":23,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0747717103000841"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(03)00084-1","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}