scientific article; zbMATH DE number 503395
From MaRDI portal
Publication:4279734
zbMath0811.13021MaRDI QIDQ4279734
Publication date: 11 December 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational aspects and applications of commutative rings (13P99) Computational aspects of higher-dimensional varieties (14Q15) Varieties and morphisms (14A10)
Related Items
On generalized Newton algorithms: Quadratic convergence, path-following and error analysis, Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds, On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?, A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time, A continuation method to solve polynomial systems and its complexity, Fast linear homotopy to find approximate zeros of polynomial systems, Computational complexity of kernel-based density-ratio estimation: a condition number analysis, Robust certified numerical homotopy tracking, Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric, On a problem posed by Steve Smale, Fast computation of zeros of polynomial systems with bounded degree under finite-precision, Condition length and complexity for the solution of polynomial systems, A note on the finite variance of the averaging function for polynomial system solving, Multihomogeneous Newton methods, Smale’s 17th problem: Average polynomial time to compute affine and projective solutions, Solving degenerate sparse polynomial systems faster, Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems, Complexity of Bezout's theorem. VII: Distance estimates in the condition metric, Some lower bounds for the complexity of continuation methods, Toric intersection theory for affine root counting, Some aspects of studying an optimization or decision problem in different computational models, Numerical continuation methods: a perspective, Perturbation theory for homogeneous polynomial eigenvalue problems, Mysteries of mathematics and computation, Systems of rational polynomial equations have polynomial size approximate zeros on the average
