Deformation techniques for efficient polynomial equation solving.
type: Item
instance of: scholarly article
title: Deformation techniques for efficient polynomial equation solving.
zbMATH Open document ID: 1041.65044
author: Joos Heintz
author: Teresa Krick
author: Susana Puddu
author: Juan Sabia
author: Ariel Waissbein
published in: Journal of Complexity
publication date: 2000-01-01T00:00:00Z
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 13P99
zbMATH DE Number: 1444122
zbMATH Keywords: polynomial equation system
zbMATH Keywords: arithmetic circuit
zbMATH Keywords: shape (or primitive element) lemma
zbMATH Keywords: Newton-Hensel iteration
describes a project that uses: Projective Noether
MaRDI profile type: Publication
full work available at URL: jcom.1999.0529
OpenAlex ID: W2060624832
cites work: Q3806684
cites work: Q4331740
cites work: The Jacobian conjecture: Reduction of degree and formal expansion of the inverse
cites work: On computing the determinant in small parallel time using a small number of processors
cites work: Polar varieties, real equation solving, and data structures: the hypersurface case
cites work: On computing a set of points meeting every cell defined by a family of polynomials on a variety
cites work: Q3714165
cites work: Generalised characteristic polynomials
cites work: Q3328651
cites work: Q4850731
cites work: Lower bounds for diophantine approximations
cites work: Straight-line programs in geometric elimination theory
cites work: Le rôle des structures de données dans les problèmes d'élimination
cites work: Q3033872
cites work: Solving systems of polynomial inequalities in subexponential time
cites work: Definability and fast quantifier elimination in algebraically closed fields
cites work: On the intrinsic complexity of the arithmetic Nullstellensatz
cites work: Sur la complexité du principe de Tarski-Seidenberg
cites work: Generic local structure of the morphisms in commutative algebra
cites work: Q4714022
cites work: Q4394966
cites work: Q4293528
cites work: Q4282674
cites work: Q4336109
cites work: Introduction to the theory of analytic spaces
cites work: Q1185456
cites work: On the affine Bezout inequality
cites work: Q4306894
cites work: Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz
cites work: Complexity of Bezout's Theorem I: Geometric Aspects
cites work: Q3135179
cites work: Complexity of Bezout's theorem. III: Condition number and packing
cites work: Complexity of Bezout's theorem. V: Polynomial time
cites work: Bounds of traces in complete intersections and degrees in the Nullstellensatz
cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
cites work: Q4047029
cites work: Q4352821
cites work: Homotopies for solving polynomial systems within a bounded domain
cites work: Lectures on results on Bezout's theorem. Notes by D. P. Patil
cites work: Q4725742
cites work: Q4693774
cites work: Q4760119
DOI: 10.1006/JCOM.1999.0529
description: scientific article; zbMATH DE number 1444122