Hybrid sparse resultant matrices for bivariate polynomials

Journal of Symbolic Computation

Volumn 33, Issue 5, 2002, Pages 587-608

  D'andrea, Carlos ^a   Emiris, Ioannis Z ^b  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (15)

1. An implicitization algorithm for rational surfaces with no base points
2. A subdivision-based algorithm for the sparse resultant
3. An algorithm for the Newton resultant
4. Residues in toric varieties
5. Residues and resultants
6. Using Algebraic Geometry, of Graduate Texts in Mathematics
7. Macaulay-style formulas for the sparse resultant
8. Hybrid resultant matrices of bivariate polynomials
9. On the complexity of sparse elimination
10. Formes d'inertie et résultant: Un formulaire
11. Determinantal formula for the Chow form of a toric surface
12. Algebraic and numeric techniques for modeling and robotics
13. On the Newton polytope of the resultant
14. Rectangular corner cutting and Sylvester A-resultants