Pages that link to "Item:Q1338222"
From MaRDI portal
The following pages link to Complexity of Bezout's theorem. V: Polynomial time (Q1338222):
Displaying 50 items.
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant (Q315740) (← links)
- Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
- The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms (Q494615) (← links)
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- Foreword. What is numerical algebraic geometry? (Q507158) (← links)
- Numerical computation of the genus of an irreducible curve within an algebraic set (Q534004) (← links)
- High probability analysis of the condition number of sparse polynomial systems (Q598221) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- A continuation method to solve polynomial systems and its complexity (Q621308) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← links)
- The nearest complex polynomial with a zero in a given complex domain (Q650944) (← links)
- A numerical algorithm for zero counting. III: Randomization and condition (Q651058) (← links)
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- A fast and stable algorithm for splitting polynomials (Q679271) (← links)
- Algorithms for near solutions to polynomial equations (Q840709) (← links)
- Smoothed analysis of complex conic condition numbers (Q864180) (← links)
- Certified predictor-corrector tracking for Newton homotopies (Q898257) (← links)
- On the probability distribution of data at points in real complete intersection varieties (Q945919) (← links)
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric (Q1022430) (← links)
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric (Q1022431) (← links)
- Some lower bounds for the complexity of continuation methods (Q1279910) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Mathematical problems for the next century (Q1582494) (← links)
- Numerical continuation methods: a perspective (Q1593828) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Approximate solutions of polynomial equations. (Q1599546) (← links)
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739) (← links)
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (Q1727976) (← links)
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
- An improvement of the complexity bound for solving systems of polynomial equations (Q1762547) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- On the geometry and topology of the solution variety for polynomial system solving (Q1928275) (← links)
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis (Q1945037) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Central limit theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems (Q2145085) (← links)
- A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- Computing singular points of projective plane algebraic curves by homotopy continuation methods (Q2320699) (← links)
- A numerical realization of the conditions of Max Nöther's residual intersection theorem (Q2352104) (← links)
- Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds (Q2387418) (← links)
- On the expected number of zeros of nonlinear equations (Q2441420) (← links)
- An arithmetic Poisson formula for the multi-variate resultant (Q2441516) (← links)
