scientific article; zbMATH DE number 1057749
From MaRDI portal
Publication:4352797
zbMATH Open0902.12005MaRDI QIDQ4352797FDOQ4352797
Authors: Marc Giusti, Joos Heintz, J. E. Morais, Luis Miguel Pardo 
Publication date: 7 December 1998
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3959582
- Efficient solution of real polynomial systems of equations
- Efficient polynomial system-solving by numerical methods
- Efficient polynomial system solving by numerical methods
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
- Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II
- Solving polynomial systems equation by equation
- Accelerated Solution of Multivariate Polynomial Systems of Equations
- Fast algorithms for polynomial solutions of linear differential equations
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III
algorithmseliminationcomplexity boundspolynomial system solvinggeometric degreearithmetic networksencoding polynomials by straight-line programsgreatest common divisor of univariate polynomialsprimitive element constructionsshape lemmas
Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99) Equations in general fields (12E12)
Cited In (49)
- Solving determinantal systems using homotopy techniques
- Matrices in elimination theory
- A concise proof of the Kronecker polynomial system solver from scratch
- Degeneracy loci and polynomial equation solving
- Change of order for regular chains in positive dimension
- Systems of rational polynomial equations have polynomial size approximate zeros on the average
- Interpolation of polynomials given by straight-line programs
- Complexity results for triangular sets
- p-adic algorithm for bivariate Gröbner bases
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- A Gröbner free alternative for polynomial system solving
- Lower bounds for diophantine approximations
- Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs
- Further perspectives on elimination
- On types of isolated KKT points in polynomial optimization
- Properness defects of projection and minimal discriminant variety
- Polar varieties, real equation solving, and data structures: the hypersurface case
- On the complexity exponent of polynomial system solving
- Straight-line programs in geometric elimination theory
- Evaluation properties of invariant polynomials
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Polynomial equation solving by lifting procedures for ramified fibers
- Evaluation techniques for zero-dimensional primary decomposition
- Computing critical points for invariant algebraic systems
- Kronecker's and Newton's approaches to solving: a first comparison
- Counting solutions of a polynomial system locally and exactly
- Fast computation of a rational point of a variety over a finite field
- On the complexity of the resolvent representation of some prime differential ideals
- Some speed-ups and speed limits for real algebraic geometry
- Solving degenerate sparse polynomial systems faster
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics
- On types of degenerate critical points of real polynomial functions
- On the intrinsic complexity of the arithmetic Nullstellensatz
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- Solving projective complete intersection faster
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
- Computing bases of complete intersection rings in Noether position
- Deformation techniques to solve generalised Pham systems
- Title not available (Why is that?)
- Functional programming concepts and straight-line programs in computer algebra
- On the probability distribution of singular varieties of given corank
- Time-space tradeoffs in algebraic complexity theory
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- Effective de Rham cohomology — The general case
- An algorithm for implicit interpolation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352797)
