{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T11:40:13Z","timestamp":1741174813596,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642210457"},{"type":"electronic","value":"9783642210464"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21046-4_4","type":"book-chapter","created":{"date-parts":[[2011,5,3]],"date-time":"2011-05-03T14:57:03Z","timestamp":1304434623000},"page":"60-85","source":"Crossref","is-referenced-by-count":1,"title":["Multivariate Resultants in Bernstein Basis"],"prefix":"10.1007","author":[{"given":"Deepak","family":"Kapur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Minimair","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Amiraslani, A.: Dividing polynomials when you only know their values. In: Gonzalez-Vega, L., Recio, T. (eds.) Proceedings of Encuentros de \u00c1lgebra Computacional y Aplicaciones (EACA) 2004, pp. 5\u201310 (2004)"},{"key":"4_CR2","series-title":"Monographs and Textbooks in Pure and Applied Mathematics","volume-title":"Polynomials and linear control systems","author":"S. Barnett","year":"1983","unstructured":"Barnett, S.: Polynomials and linear control systems. Monographs and Textbooks in Pure and Applied Mathematics, vol.\u00a077. Marcel Dekker Inc., New York (1983)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0024-3795(84)90077-6","volume":"60","author":"S. Barnett","year":"1984","unstructured":"Barnett, S.: Division of generalized polynomials using the comrade matrix. Linear Algebra Appl.\u00a060, 159\u2013175 (1984)","journal-title":"Linear Algebra Appl."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0024-3795(88)90128-0","volume":"99","author":"S. Barnett","year":"1988","unstructured":"Barnett, S.: Euclidean remainders for generalized polynomials. Linear Algebra Appl.\u00a099, 111\u2013122 (1988)","journal-title":"Linear Algebra Appl."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Berchtold, J., Bowyer, A.: Robust arithmetic for multivariate bernstein-form polynomials. In: Computer-Aided Design, pp. 681\u2013689 (2000)","DOI":"10.1016\/S0010-4485(00)00056-7"},{"issue":"2-3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.tcs.2004.01.016","volume":"315","author":"D.A. Bini","year":"2004","unstructured":"Bini, D.A., Gemignani, L.: Bernstein-Bezoutian matrices. Theoret. Comput. Sci.\u00a0315(2-3), 319\u2013333 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"4_CR7","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1002\/nla.444","volume":"12","author":"D.A. Bini","year":"2005","unstructured":"Bini, D.A., Gemignani, L., Winkler, J.R.: Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis. Numer. Linear Algebra Appl.\u00a012(8), 685\u2013698 (2005)","journal-title":"Numer. Linear Algebra Appl."},{"key":"4_CR8","unstructured":"Brazier, M., Chcherba, A.: MatDetInterp. Symbolic matrix determinant interpolator, http:\/\/www.chtcherba.com\/arthur\/Projects\/MatDetInterp\/"},{"issue":"4-5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1006\/jsco.1999.0304","volume":"29","author":"L. Bus\u00e9","year":"2000","unstructured":"Bus\u00e9, L., Elkadi, M., Mourrain, B.: Generalized resultants over unirational algebraic varieties. J. Symbolic Computation\u00a029(4-5), 515\u2013526 (2000)","journal-title":"J. Symbolic Computation"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0747-7171(08)80012-0","volume":"9","author":"J. Canny","year":"1990","unstructured":"Canny, J.: Generalised characteristic polynomials. J. Symbolic Computation\u00a09, 241\u2013250 (1990)","journal-title":"J. Symbolic Computation"},{"key":"4_CR11","first-page":"47","volume-title":"ISSAC 2006","author":"H. Cheng","year":"2006","unstructured":"Cheng, H., Labahn, G.: On computing polynomial GCDs in alternate bases. In: ISSAC 2006, pp. 47\u201354. ACM, New York (2006)"},{"issue":"3-4","key":"4_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0747-7171(03)00084-1","volume":"36","author":"A. Chtcherba","year":"2003","unstructured":"Chtcherba, A., Kapur, D.: Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation. J. Symbolic Computation\u00a036(3-4), 289\u2013315 (2003)","journal-title":"J. Symbolic Computation"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/11555964_11","volume-title":"Computer Algebra in Scientific Computing","author":"A.D. Chtcherba","year":"2005","unstructured":"Chtcherba, A.D., Kapur, D., Minimair, M.: Cayley-dixon resultant matrices of multi-univariate composed polynomials. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol.\u00a03718, pp. 125\u2013137. Springer, Heidelberg (2005)"},{"key":"4_CR14","unstructured":"Chtcherba, A.D.: A new Sylvester-type Resultant Method based on the Dixon-B\u00e9zout Formulation. PhD dissertation, University of New Mexico, Department of Computer Science (August 2003)"},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/1145768.1145784","volume-title":"ISSAC 2006: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation","author":"A.D. Chtcherba","year":"2006","unstructured":"Chtcherba, A.D., Kapur, D.: Conditions for determinantal formula for resultant of a polynomial system. In: ISSAC 2006: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, Genoa, Italy, pp. 55\u201362. ACM, New York (2006), doi:10.1145\/1145768.1145784"},{"key":"4_CR16","unstructured":"Corless, R.: Generalized companion matrices in the lagrange basis. In: Gonzalez-Vega, L., Recio, T. (eds.) Proceedings of Encuentros de \u00c1lgebra Computacional y Aplicaciones (EACA) 2004, pp. 317\u2013322 (2004)"},{"key":"4_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6911-1","volume-title":"Using Algebraic Geometry","author":"D. Cox","year":"1998","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Using Algebraic Geometry. Springer, Heidelberg (1998)"},{"issue":"7","key":"4_CR18","doi-asserted-by":"publisher","first-page":"2595","DOI":"10.1090\/S0002-9947-02-02910-0","volume":"354","author":"C. D\u2019Andrea","year":"2002","unstructured":"D\u2019Andrea, C.: Macaulay style formulas for sparse resultants. Trans. Amer. Math. Soc.\u00a0354(7), 2595\u20132629 (electronic) (2002)","journal-title":"Trans. Amer. Math. Soc."},{"key":"4_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02888-9","volume-title":"Constructive Approximation","author":"R.A. Devore","year":"1993","unstructured":"Devore, R.A., Lorentz, G.G.: Constructive Approximation. Springer, Heidelberg (1993)"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/jsco.2002.0542","volume":"34","author":"G.M. Diaz-Toca","year":"2002","unstructured":"Diaz-Toca, G.M., Gonzalez-Vega, L.: Barnett\u2019s theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices. J. Symbolic Comput.\u00a034(1), 59\u201381 (2002)","journal-title":"J. Symbolic Comput."},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1112\/plms\/s2-6.1.468","volume":"6","author":"A.-L. Dixon","year":"1908","unstructured":"Dixon, A.-L.: On a form of the elimination of two quantics. Proc. London Math. Soc.\u00a06, 468\u2013478 (1908)","journal-title":"Proc. London Math. Soc."},{"key":"4_CR22","volume-title":"Curves and Surfaces for CAGD: A practical guide","author":"G.F. Farin","year":"1991","unstructured":"Farin, G.F.: Curves and Surfaces for CAGD: A practical guide, 5th edn. Morgan Kaufmann, San Francisco (1991)","edition":"5"},{"key":"4_CR23","unstructured":"Gemignani, L.: Manipulating polynomials in generalized form. Tech. Rep. TR-96-14, Universit\u00e0 di Pisa, Departmento di Informatica, Corso Italia 40, 56125 Pisa, Italy (December 1996)"},{"key":"4_CR24","unstructured":"Heymann, W.: Problem der Winkelhalbierenden. Ztschr. f. Math. und Phys. 35 (1890)"},{"key":"4_CR25","first-page":"184","volume-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing","author":"D. Kapur","year":"1996","unstructured":"Kapur, D., Saxena, T.: Sparsity considerations in Dixon resultants. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, pp. 184\u2013191. ACM, New York (1996)"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Kapur, D., Saxena, T., Yang, L.: Algebraic and geometric reasoning using the Dixon resultants. In: ACM ISSAC 1994, Oxford, England, pp. 99\u2013107 (July 1994)","DOI":"10.1145\/190347.190372"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Lewis, R.: Comparing acceleration techniques for the Dixon and Macaulay resultants. Mathematics and Computers in Simulation (2008) (accepted)","DOI":"10.1145\/1394042.1394088"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Macaulay, F.S.: The algebraic theory of modular systems. Cambridge Mathematical Library (1916)","DOI":"10.3792\/chmm\/1263317740"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0024-3795(95)00585-4","volume":"251","author":"V. Mani","year":"1997","unstructured":"Mani, V., Hartwig, R.E.: Generalized polynomial bases and the Bezoutian. Linear Algebra Appl.\u00a0251, 293\u2013320 (1997)","journal-title":"Linear Algebra Appl."},{"key":"4_CR30","first-page":"1","volume":"20","author":"D. Manocha","year":"1997","unstructured":"Manocha, D., Krishnan, S.: Algebraic pruning: A fast technique for curve and surface intersection. Computer-Aided Geometric Design\u00a020, 1\u201323 (1997)","journal-title":"Computer-Aided Geometric Design"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0024-3795(78)90071-X","volume":"22","author":"J. Maroulas","year":"1978","unstructured":"Maroulas, J., Barnett, S.: Greatest common divisor of generalized polynomial and polynomial matrices. Linear Algebra Appl.\u00a022, 195\u2013210 (1978)","journal-title":"Linear Algebra Appl."},{"key":"4_CR32","unstructured":"Minimair, M.: MR, macaulay resultant package for Maple (April 2003), http:\/\/minimair.org\/MR.mpl"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Minimair, M.: Basis-independent polynomial division algorithm applied to division in lagrange and bernstein basis (CD-ROM). In: Kapur, D. (ed.) Proceedings of Asian Symposium on Computer Mathematics (ASCM). National University of Singapore (2007)","DOI":"10.1007\/978-3-540-87827-8_6"},{"key":"4_CR34","unstructured":"Minimair, M.: DR, Maple package for computing Dixon projection operators (resultants) (2007), http:\/\/minimair.org\/dr"},{"issue":"2","key":"4_CR35","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/383738.383743","volume":"27","author":"Y.-F. Tsai","year":"2001","unstructured":"Tsai, Y.-F., Farouki, R.T.: Algorithm 812: BPOLY: An object-oriented library of numerical algorithms for polynomials in Bernstein form. ACM Transactions on Mathematical Software\u00a027(2), 267\u2013296 (2001)","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"1-3","key":"4_CR36","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0024-3795(00)00189-0","volume":"319","author":"J.R. Winkler","year":"2000","unstructured":"Winkler, J.R.: A resultant matrix for scaled Bernstein polynomials. Linear Algebra Appl.\u00a0319(1-3), 179\u2013191 (2000)","journal-title":"Linear Algebra Appl."},{"key":"4_CR37","first-page":"535","volume-title":"Mathematical Methods for Curves and Surfaces","author":"J.R. Winkler","year":"2001","unstructured":"Winkler, J.R.: Computational experiments with resultants for scaled Bernstein polynomials. In: Mathematical Methods for Curves and Surfaces, Oslo, pp. 535\u2013544. Innov. Appl. Math., Vanderbilt Univ. Press, Nashville, TN (2001)"},{"key":"4_CR38","series-title":"Kluwer Internat. Ser. Engrg. Comput. Sci.","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4615-0813-7_16","volume-title":"Uncertainty in Geometric Computations","author":"J.R. Winkler","year":"2002","unstructured":"Winkler, J.R.: Properties of the companion matrix resultant for Bernstein polynomials. In: Uncertainty in Geometric Computations. Kluwer Internat. Ser. Engrg. Comput. Sci., vol.\u00a0704, pp. 185\u2013198. Kluwer Acad. Publ., Boston (2002)"},{"key":"4_CR39","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0024-3795(02)00486-X","volume":"362","author":"J.R. Winkler","year":"2003","unstructured":"Winkler, J.R.: A companion matrix resultant for Bernstein polynomials. Linear Algebra Appl.\u00a0362, 153\u2013175 (2003)","journal-title":"Linear Algebra Appl."},{"key":"4_CR40","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-27157-0_8","volume-title":"Computational Methods for Algebraic Spline Surfaces","author":"J.R. Winkler","year":"2005","unstructured":"Winkler, J.R.: Numerical and algebraic properties of Bernstein basis resultant matrices. In: Computational Methods for Algebraic Spline Surfaces, pp. 107\u2013118. Springer, Berlin (2005)"},{"key":"4_CR41","series-title":"Mod. Methods Math.","first-page":"407","volume-title":"Curve and Surface Design","author":"J.R. Winkler","year":"2003","unstructured":"Winkler, J.R., Goldman, R.N.: The Sylvester resultant matrix for Bernstein polynomials. In: Curve and Surface Design, Saint-Malo. Mod. Methods Math., pp. 407\u2013416. Nashboro Press, Brentwood (2003)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction in Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21046-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T10:37:28Z","timestamp":1741171048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21046-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642210457","9783642210464"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21046-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}