scientific article; zbMATH DE number 1057749
From MaRDI portal
Publication:4352797
zbMath0902.12005MaRDI QIDQ4352797
J. E. Morais, Joos Heintz, Marc Giusti, Luis Miguel Pardo
Publication date: 7 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmsgeometric degreeeliminationcomplexity boundspolynomial system solvingarithmetic 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)
Related Items
Complexity results for triangular sets, Lower bounds for diophantine approximations, Polar varieties, real equation solving, and data structures: the hypersurface case, On the complexity exponent of polynomial system solving, Polynomial equation solving by lifting procedures for ramified fibers, Deformation techniques to solve generalised Pham systems, Straight-line programs in geometric elimination theory, Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics, p-adic algorithm for bivariate Gröbner bases, Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization, A concise proof of the Kronecker polynomial system solver from scratch, Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs, Further perspectives on elimination, Counting solutions of a polynomial system locally and exactly, A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, On the probability distribution of singular varieties of given corank, Solving determinantal systems using homotopy techniques, Time-space tradeoffs in algebraic complexity theory, Homotopy techniques for solving sparse column support determinantal polynomial systems, Change of order for regular chains in positive dimension, A Gröbner free alternative for polynomial system solving, Kronecker's and Newton's approaches to solving: a first comparison, On the complexity of the resolvent representation of some prime differential ideals, Computing bases of complete intersection rings in Noether position, Properness defects of projection and minimal discriminant variety, On types of degenerate critical points of real polynomial functions, Evaluation properties of invariant polynomials, An algorithm for implicit interpolation, Matrices in elimination theory, Solving degenerate sparse polynomial systems faster, Effective de Rham cohomology — The general case, Interpolation of polynomials given by straight-line programs, Evaluation techniques for zero-dimensional primary decomposition, Fast computation of a rational point of a variety over a finite field, Functional programming concepts and straight-line programs in computer algebra, Bit complexity for computing one point in each connected component of a smooth real algebraic set, Computing critical points for invariant algebraic systems, Some speed-ups and speed limits for real algebraic geometry, Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity, Systems of rational polynomial equations have polynomial size approximate zeros on the average, Solving parametric systems of polynomial equations over the reals through Hermite matrices
