Techniques for exploiting structure in matrix formulae of the sparse resultant
type: Item
instance of: scholarly article
title: Techniques for exploiting structure in matrix formulae of the sparse resultant
zbMATH Open document ID: 0904.65049
DOI: 10.1007/BF02576009
author: Ioannis Z. Emiris
author: Victor Y. Pan
published in: Calcolo
publication date: 1998-08-10T00:00:00Z
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 26C10
Mathematics Subject Classification ID: 30C15
zbMATH DE Number: 1186679
zbMATH Keywords: systems of polynomial equations
zbMATH Keywords: sparse resultant
zbMATH Keywords: Newton polytopes
zbMATH Keywords: Macaulay's matrix
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
cites work: Q4091421
cites work: The number of roots of a system of equations
cites work: Q4314299
cites work: Constructing roadmaps of semi-algebraic sets. I: Completeness
cites work: Q4279509
cites work: Efficient incremental algorithms for the sparse resultant and the mixed volume
cites work: Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
cites work: On the complexity of sparse elimination
cites work: Q4226961
cites work: Hyperdeterminants
cites work: Q3359644
cites work: Q4038737
cites work: Q4336109
cites work: Parallel computation of polynomial GCD and some related parallel computations over abstract fields
cites work: Q3868672
cites work: Product formulas for resultants and Chow forms
cites work: Solving sparse linear equations over finite fields
cites work: Q4274348
full work available at URL: https://doi.org/10.1007/bf02576009
OpenAlex ID: W2008603328
description: scientific article; zbMATH DE number 1186679