Specified precision polynomial root isolation is in NC
From MaRDI portal
Recommendations
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
- On the parallel arithmetic complexity of the root-finding problem
- On the Complexity of Polynomial Zeros
- NC algorithms for real algebraic numbers
- Simple algorithms for approximating all roots of a polynomial with real roots
Cites work
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
- An inequality for the discriminant of a polynomial
- Complexity of parallel matrix computations
- Effective Noether irreducibility forms and applications
- Fast parallel absolute irreducibility testing
- Fast parallel matrix and GCD computations
- Fast Parallel Matrix Inversion Algorithms
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3437452 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- On computing the determinant in small parallel time using a small number of processors
- On the cost of approximating all roots of a complex polynomial
- On the Problem of Runs
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
- Parallel Algorithms for Algebraic Problems
- Parallel evaluation of the determinant and of the inverse of a matrix
- Polynomial Remainder Sequences and Determinants
- Representations and Parallel Computations for Rational Functions
- Simple algorithms for approximating all roots of a polynomial with real roots
- Subresultants and Reduced Polynomial Remainder Sequences
Cited in
(21)- The Sturm method in the complex case
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- An efficient algorithm for the complex roots problem
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Advice coins for classical and quantum computation
- On the parallel arithmetic complexity of the root-finding problem
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
- On parallel complexity of analytic functions
- On the Complexity of Polynomial Zeros
- Factoring Rational Polynomials over the Complex Numbers
- scientific article; zbMATH DE number 880381 (Why is no real title available?)
- A lower bound for the shortest path problem
- Unifying lower bounds for algebraic machines, semantically
- Root finding with threshold circuits
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Encounters in symbolic computation: ideas for the ages
- Simple algorithms for approximating all roots of a polynomial with real roots
- On invariance of degree for certain computations
This page was built for publication: Specified precision polynomial root isolation is in NC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329153)
