Dense resultant of composed polynomials
- 1 December 2003
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 36 (6) , 825-834
- https://doi.org/10.1016/s0747-7171(03)00039-7
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Sparse Resultant of Composed Polynomials I Mixed–Unmixed CaseJournal of Symbolic Computation, 2002
- A subdivision-based algorithm for the sparse resultantJournal of the ACM, 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
- A chain rule for multivariable resultantsProceedings of the American Mathematical Society, 1995
- Le formalisme du résultantAdvances in Mathematics, 1991
- The algebraic theory of modular systemsPublished by Project Euclid ,1916
- The Eliminant of Three Quantics in two Independent Variables: (Second Paper.)Proceedings of the London Mathematical Society, 1909