Sparse Resultant of Composed Polynomials I Mixed–Unmixed Case
- 1 April 2002
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 33 (4) , 447-465
- https://doi.org/10.1006/jsco.2001.0516
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Explicit formulas for the multivariate resultantJournal of Pure and Applied Algebra, 2001
- Generalized Resultants over Unirational Algebraic VarietiesJournal of Symbolic Computation, 2000
- Solving the recognition problem for six lines using the Dixon resultantMathematics and Computers in Simulation, 1999
- Calculating the Galois group of L1(L2(y))=0,L1,L2 completely reducible operatorsJournal of Pure and Applied Algebra, 1999
- Groebner Basis Under Composition IJournal of Symbolic Computation, 1998
- Subresultants Under CompositionJournal of Symbolic Computation, 1997
- Efficient Incremental Algorithms for the Sparse Resultant and the Mixed VolumeJournal of Symbolic Computation, 1995
- Product formulas for resultants and Chow formsMathematische Zeitschrift, 1993
- MultiPolynomial Resultant AlgorithmsJournal of Symbolic Computation, 1993
- Le formalisme du résultantAdvances in Mathematics, 1991