Pages that link to "Item:Q3831940"
From MaRDI portal
The following pages link to On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (Q3831940):
Displayed 20 items.
- On a problem posed by Steve Smale (Q661924) (← links)
- Continuous alternation: the complexity of pursuit in continuous domains (Q686740) (← links)
- Generalised characteristic polynomials (Q916718) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Complexity of functions: Some questions, conjectures, and results (Q1174450) (← links)
- Effective Łojasiewicz inequalities in semialgebraic geometry (Q1177863) (← links)
- Counting connected components of a semialgebraic set in subexponential time (Q1207337) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- Probing the arrangement of hyperplanes (Q1842647) (← links)
- Multivariate polynomials, duality, and structured matrices (Q1977144) (← links)
- Probing a set of hyperplanes by lines and related problems (Q5060099) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Finding connected components of a semialgebraic set in subexponential time (Q5905520) (← links)
- Finding connected components of a semialgebraic set in subexponential time (Q5966655) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)