On the complexity of sparse elimination
From MaRDI portal
Publication:2565194
DOI10.1006/jcom.1996.0010zbMath0935.12008OpenAlexW1995786326WikidataQ57908792 ScholiaQ57908792MaRDI QIDQ2565194
Publication date: 11 May 2000
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/20606802b5400d0b3592685e8d0e6bdf53959067
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (18)
Lower bounds for diophantine approximations ⋮ Techniques for exploiting structure in matrix formulae of the sparse resultant ⋮ Implicitization of curves and (hyper)surfaces using predicted support ⋮ Toric eigenvalue methods for solving sparse polynomial systems ⋮ Computing mixed volume and all mixed cells in quermassintegral time ⋮ Sparse difference resultant ⋮ Elimination theory in differential and difference algebra ⋮ Solving a sparse system using linear algebra ⋮ Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems ⋮ Hybrid sparse resultant matrices for bivariate polynomials ⋮ Using symmetries in the eigenvalue method for polynomial systems ⋮ Rational univariate reduction via toric resultants ⋮ Matrices in elimination theory ⋮ Towards toric absolute factorization ⋮ How to count efficiently all affine roots of a polynomial system ⋮ Symbolic and numeric methods for exploiting structure in constructing resultant matrices ⋮ Enumerating a subset of the integer points inside a Minkowski sum ⋮ Sparse differential resultant for Laurent differential polynomials
This page was built for publication: On the complexity of sparse elimination
