scientific article; zbMATH DE number 1057737
From MaRDI portal
Publication:4352783
zbMath0899.68054MaRDI QIDQ4352783
Publication date: 1 November 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational aspects in algebraic geometry (14Q99)
Related Items
Fast computation of discrete invariants associated to a differential rational mapping, Complexity results for triangular sets, On Kolmogorov complexity in the real Turing machine setting, Lower bounds for diophantine approximations, Polar varieties, real equation solving, and data structures: the hypersurface case, Polynomial equation solving by lifting procedures for ramified fibers, Deformation techniques to solve generalised Pham systems, Straight-line programs in geometric elimination theory, Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics, A concise proof of the Kronecker polynomial system solver from scratch, Computing the characteristic polynomial of multivariate polynomial matrices given by straight-line programs, An arithmetic Poisson formula for the multi-variate resultant, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, On the probability distribution of singular varieties of given corank, Time-space tradeoffs in algebraic complexity theory, A Gröbner free alternative for polynomial system solving, Kronecker's and Newton's approaches to solving: a first comparison, A new method to obtain lower bounds for polynomial evaluation, Properness defects of projection and minimal discriminant variety, An algorithm for implicit interpolation, A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density, Effective de Rham cohomology — The general case, Deformation techniques for sparse systems, Evaluation techniques for zero-dimensional primary decomposition, A sparse effective Nullstellensatz, Fast computation of a rational point of a variety over a finite field, Functional programming concepts and straight-line programs in computer algebra, Systems of rational polynomial equations have polynomial size approximate zeros on the average
