Complexity of Bezout's theorem. V: Polynomial time

Complexity and performance of numerical algorithms (65Y20) Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The kinematic formula in Riemannian homogeneous spaces
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
The fundamental theorem of algebra and complexity theory
Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
Complexity of Bezout's theorem. III: Condition number and packing
Complexity of Bezout's Theorem I: Geometric Aspects
Separation of complexity classes in Koiran's weak model
Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
Some Remarks on the Foundations of Numerical Analysis

Cited In (63)

Smale 17th Problem: Advances and Open Directions
A numerical realization of the conditions of Max Nöther's residual intersection theorem
The average condition number of most tensor rank decomposition problems is infinite
Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds
Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
Fast computation of zeros of polynomial systems with bounded degree under finite-precision
A fast and stable algorithm for splitting polynomials
Systems of rational polynomial equations have polynomial size approximate zeros on the average
A continuation method to solve polynomial systems and its complexity
Multihomogeneous Newton methods
Newton's method for overdetermined systems of equations
Some lower bounds for the complexity of continuation methods
On the geometry of Graeffe iteration
Lower bounds for diophantine approximations
A numerical algorithm for zero counting. III: Randomization and condition
Grid methods in computational real algebraic (and semialgebraic) geometry
On a problem posed by Steve Smale
Polar varieties, real equation solving, and data structures: the hypersurface case
Geometry of polynomials and root-finding via path-lifting
On the probability distribution of data at points in real complete intersection varieties
Optimal and nearly optimal algorithms for approximating polynomial zeros
Straight-line programs in geometric elimination theory
High probability analysis of the condition number of sparse polynomial systems
Mathematical problems for the next century
Smoothed analysis of complex conic condition numbers
The probability that a slightly perturbed numerical analysis problem is difficult
Kronecker's and Newton's approaches to solving: a first comparison
On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
Deformation techniques for efficient polynomial equation solving.
Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
A note on the finite variance of the averaging function for polynomial system solving
On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
Computational complexity of kernel-based density-ratio estimation: a condition number analysis
Fast linear homotopy to find approximate zeros of polynomial systems
Numerical continuation methods: a perspective
Complexity of path-following methods for the eigenvalue problem
On the geometry and topology of the solution variety for polynomial system solving
Computing the homology of semialgebraic sets. I: Lax formulas
Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
The nearest complex polynomial with a zero in a given complex domain
Globally convergent, iterative path-following for algebraic equations
Deformation techniques to solve generalised Pham systems
Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
Computing singular points of projective plane algebraic curves by homotopy continuation methods
Rigid continuation paths II. structured polynomial systems
Condition length and complexity for the solution of polynomial systems
Foreword. What is numerical algebraic geometry?
Central limit theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems
On a condition number of general random polynomial systems
On the expected number of zeros of nonlinear equations
On solving univariate sparse polynomials in logarithmic time
Computing the homology of real projective sets
Robust certified numerical homotopy tracking
An arithmetic Poisson formula for the multi-variate resultant
Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
On the probability distribution of singular varieties of given corank
The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms
Certified predictor-corrector tracking for Newton homotopies
A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
Numerical computation of the genus of an irreducible curve within an algebraic set
Real computations with fake numbers

This page was built for publication: Complexity of Bezout's theorem. V: Polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338222)