Sparse resultant of composed polynomials. II: Unmixed-mixed case.
type: Item
instance of: scholarly article
title: Sparse resultant of composed polynomials. II: Unmixed-mixed case.
zbMATH Open document ID: 1041.13020
author: Manfred Minimair
published in: Journal of Symbolic Computation
publication date: 2002-06-11T00:00:00Z
Mathematics Subject Classification ID: 13P05
Mathematics Subject Classification ID: 13F20
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1754166
zbMATH Keywords: computing sparse resultants
zbMATH Keywords: efficiency
zbMATH Keywords: composed polynomials
MaRDI profile type: Publication
full work available at URL: jsco.2001.0517
OpenAlex ID: W4210476245
cites work: Calculating the Galois group of \(L_1(L_2(y))=0,\) \(L_1, L_2\) completely reducible operators
cites work: Generalized resultants over unirational algebraic varieties
cites work: A subdivision-based algorithm for the sparse resultant
cites work: Residues and Resultants
cites work: Q4209232
cites work: A Chain Rule for Multivariable Resultants
cites work: Q4226961
cites work: Q4293510
cites work: Q3983707
cites work: Subresultants under composition
cites work: Groebner basis under composition. I
cites work: Le formalisme du résultant. (The formalism of resultant)
cites work: Q4228470
cites work: Q4226953
cites work: Q4293528
cites work: Multipolynomial resultant algorithms
cites work: Product formulas for resultants and Chow forms
cites work: Solving degenerate sparse polynomial systems faster
DOI: 10.1006/JSCO.2001.0517
description: scientific article; zbMATH DE number 1754166