Pages that link to "Item:Q1683739"
From MaRDI portal
The following pages link to A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739):
Displaying 17 items.
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- Complexity of Bezout's theorem. V: Polynomial time (Q1338222) (← links)
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (Q1727976) (← links)
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions (Q1727980) (← links)
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
- Mixed precision path tracking for polynomial homotopy continuation (Q2240693) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces (Q2674002) (← links)
- The average condition number of most tensor rank decomposition problems is infinite (Q2697393) (← links)
- Smale 17th Problem: Advances and Open Directions (Q3380357) (← links)
- Smoothed analysis for the condition number of structured real polynomial systems (Q4999472) (← links)
- A sequence of polynomials with optimal condition number (Q5147325) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers (Q5886342) (← links)
- Algebraic compressed sensing (Q6042618) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
- Estimation under group actions: recovering orbits from invariants (Q6172176) (← links)
