Pages that link to "Item:Q1329153"
From MaRDI portal
The following pages link to Specified precision polynomial root isolation is in NC (Q1329153):
Displaying 10 items.
- On parallel complexity of analytic functions (Q388112) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- The Sturm method in the complex case (Q1208221) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Bit-complexity of solving systems of linear evolutionary partial differential equations (Q2117092) (← links)
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
- Advice Coins for Classical and Quantum Computation (Q3012792) (← links)
