On parallel complexity of analytic functions
From MaRDI portal
Publication:388112
DOI10.1016/j.tcs.2013.04.008zbMath1296.03023OpenAlexW1983373088MaRDI QIDQ388112
Publication date: 19 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.04.008
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computation over the reals, computable analysis (03D78)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Real functions, contraction mappings, and P-completeness
- The computational complexity of maximization and integration
- Computing power series in polynomial time
- Solution of equations involving analytic functions
- Computational complexity of real functions
- A very hard log-space counting class
- Specified precision polynomial root isolation is in NC
- Weierstrass formula and zero-finding methods
- Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions.
- On initial conditions for the convergence of simultaneous root finding methods
- Computing the zeros of analytic functions
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- Division in logspace-uniformNC1
- Feasible Real Functions and Arithmetic Circuits
- Log Depth Circuits for Division and Related Problems
- Fast Parallel Matrix Inversion Algorithms
- Fast parallel matrix and GCD computations
- Computational Complexity of Two-Dimensional Regions
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
- A Numerical Method for Locating the Zeros of an Analytic Function
This page was built for publication: On parallel complexity of analytic functions
