On the complexity of computing the logarithm and square root functions on a complex domain

DOI10.1016/J.JCO.2006.05.007zbMath1157.65332OpenAlexW2112173210MaRDI QIDQ870336

Fuxiang Yu, Ker-I. Ko

Publication date: 12 March 2007

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2006.05.007

zbMATH Keywords

computational complexitywinding numberlogarithmcomplex planesquare root

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Complexity and performance of numerical algorithms (65Y20) Elementary functions (26A09) Higher logarithm functions (33B30)

Related Items (3)

In Memoriam: Ker-I Ko (1950–2018) ⋮ Jordan Areas and Grids ⋮ On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time computable curve whose interior has a nonrecursive measure
• Computational complexity of real functions
• On the computability of fractal dimensions and Hausdorff measure
• The power of the middle bit of a \(\#\)P function
• On the complexity of finding paths in a two-dimensional domain I: Shortest paths
• The computational complexity of some julia sets
• Computational Complexity of Two-Dimensional Regions
• Non-computable Julia sets

This page was built for publication: On the complexity of computing the logarithm and square root functions on a complex domain