scientific article; zbMATH DE number 1096865
From MaRDI portal
Publication:4372496
zbMath0948.68068MaRDI QIDQ4372496
Lenore Blum, Felipe Cucker, Michael Shub, Stephen Smale
Publication date: 14 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory, On Kolmogorov complexity in the real Turing machine setting, A brief and understandable guide to pseudo-random number generators and specific models for security, On roots of quaternion polynomials., Satisfying more than half of a system of linear equations over GF(2): a multivariate approach, Few Product Gates But Many Zeros, Local convergence of the Newton’s method in two step nilpotent Lie groups, On the Order of Power Series and the Sum of Square Roots Problem, Sparse recovery with integrality constraints, Deciding positivity of multisymmetric polynomials, Local convergence analysis of inexact Newton-like methods under majorant condition, Low dimensional hybrid systems -- decidable, undecidable, don't know, Condition number based complexity estimate for solving polynomial systems, Convergence of Newton's method for sections on Riemannian manifolds, Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing, Geometry of polynomials and root-finding via path-lifting, Exact computation of the topology and geometric invariants of the Voronoi diagram of spheres in 3D, Unnamed Item, A counterexample to the Hirsch conjecture, Numerical approximation of multiple isolated roots of analytical systems, System theory for system identification., Dynamics of quadratic polynomials over local fields, Newton's method for sections on Riemannian manifolds: Generalized covariant \(\alpha \)-theory, Parallel computation in spiking neural nets, A robust semi-local convergence analysis of Newton's method for cone inclusion problems in Banach spaces under affine invariant majorant condition, A generalization of Müller's iteration method based on standard information, Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time, A sequence of polynomials with optimal condition number, Theses for Computation and Recursion on Concrete and Abstract Structures, On approximate triangular decompositions in dimension zero, Discretization of the Bloch sphere, fractal invariant sets and Bell’s theorem, Unconventional complexity measures for unconventional computers, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, On the ultimate complexity of factorials, An optical model of computation, Effective detection of nonsplit module extensions., Recent progress in exact geometric computation, Complexity of cylindrical decompositions of sub-Pfaffian, On a condition number of general random polynomial systems, Uniqueness of the singular points of vector fields on Riemannian manifolds under the \(\gamma\)-condition, Robustness analysis via the running time of the interior point methods, A Newton-based approach for attributing tumor lethality in animal carcinogenicity studies., Real Root Isolation of Polynomial Equations Based on Hybrid Computation, Local convergence of Newton's method on the Heisenberg group, On isolation of simple multiple zeros and clusters of zeros of polynomial systems, Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals, Rational univariate reduction via toric resultants, Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals, Robust Point-Location in Generalized Voronoi Diagrams, Discreteness is undecidable, Statistical and algebraic analysis of a family of random Boolean equations, Smale's point estimate theory for Newton's method on Lie groups, $$P\mathop{ =}\limits^{?}NP$$, Condition number based complexity estimate for computing local extrema, Some lower bounds for the complexity of continuation methods, Toric Newton method for polynomial homotopies, An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms, Computing combinatorial types of trajectories in Pfaffian dynamics, Smoothed analysis for the condition number of structured real polynomial systems, Mathematical problems for the next century, Complexity of computing the local dimension of a semialgebraic set, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Newton's method for analytic systems of equations with constant rank derivatives, Distributing many points on spheres: minimal energy and designs, On the computational structure of the connected components of a hard problem, Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions., Logics which capture complexity classes over the reals
