Le rôle des structures de données dans les problèmes d'élimination
From MaRDI portal
Publication:4385803
DOI10.1016/S0764-4442(97)83558-6zbMath0893.68144MaRDI QIDQ4385803
Marc Giusti, Joos Heintz, J. E. Morais, Luis Miguel Pardo
Publication date: 20 April 1998
Published in: Comptes Rendus de l'Académie des Sciences - Series I - Mathematics (Search for Journal in Brave)
Analysis of algorithms (68W40) Data structures (68P05) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
Polynomial equation solving by lifting procedures for ramified fibers, Deformation techniques to solve generalised Pham systems, Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization, A concise proof of the Kronecker polynomial system solver from scratch, Further perspectives on elimination, 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, Relaxed Hensel lifting of triangular sets, On the probability distribution of singular varieties of given corank, Deformation techniques for efficient polynomial equation solving., A Gröbner free alternative for polynomial system solving, Kronecker's and Newton's approaches to solving: a first comparison, Properness defects of projection and minimal discriminant variety, A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density, Fast computation of a rational point of a variety over a finite field, Systems of rational polynomial equations have polynomial size approximate zeros on the average
