Deformation Techniques for Efficient Polynomial Equation Solving
Authors:
- Joos HeintzabJHJoos Heintzab
- Teresa KrickcTKTeresa Krickc
- Susana PudducSPSusana Pudduc
- Juan SabiacJSJuan Sabiac
- Ariel WaissbeincAWAriel Waissbeinc
- 1 March 2000
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 16 (1) , 70-109
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Straight-line programs in geometric elimination theoryJournal of Pure and Applied Algebra, 1998
- Le rôle des structures de données dans les problèmes d'éliminationComptes Rendus de l'Académie des Sciences - Series I - Mathematics, 1997
- Lower bounds for diophantine approximationsJournal of Pure and Applied Algebra, 1997
- Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface CaseJournal of Complexity, 1997
- On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a VarietyJournal of Complexity, 1997
- Generalised characteristic polynomialsJournal of Symbolic Computation, 1990
- Solving systems of polynomial inequalities in subexponential timeJournal of Symbolic Computation, 1988
- An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations1988
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- The Jacobian conjecture: Reduction of degree and formal expansion of the inverseBulletin of the American Mathematical Society, 1982