Sparse resultant of composed polynomials I. Mixed-Unmixed case

Journal of Symbolic Computation

Volumn 33, Issue 4, 2002, Pages 447-465

  Hong, Hoon ^a   Minimair, Manfred ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036226608     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2001.0516     Document Type: Article

References (33)

1. 2 completely reducible operators
2. Generalized resultants over unirational algebraic varieties
3. An efficient algorithm for the sparse mixed resultant
4. Solving systems of non-linear polynomial equations faster
5. Residues and resultants
6. On the theory of elimination
7. Contributions à l'algèbre commutative effective et à la théorie del'élimination
8. A chain rule for multivariable resultants
9. Explicit formulas for the multivariate resultant
10. The eliminant of three quantics in two independent variables
11. Efficient incremental algorithms for the sparse resultant and mixed volume
12. The structure of sparse resultant matrices
13. Symbolic and numeric methods for exploiting structure in constructing resultant matrices
14. Sur un problème de géométrie diophantienne linéaire. I
15. Une théorie des sous-résultants pour les polynômes en plusieurs variables
16. Subresultants under composition
17. Groebner basis under composition. I
18. Le formalisme du résultant
19. Sparsity considerations in Dixon resultants
20. Solving the recognition problem for six lines using the Dixon resultant
21. Multipolynomial resultant algorithms
22. Elimination with the Dixon resultant
23. Product formulas for resultants and Chow forms
24. Solving degenerate sparse polynomial systems faster
25. Toric intersection theory for affine root counting