Lower Bounds on the Continuation of Holomorphic Functions

DOI10.1016/j.entcs.2008.12.018zbMath1262.03145OpenAlexW2008703932MaRDI QIDQ4918016

Robert Rettinger

Publication date: 3 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.018

zbMATH Keywords

holomorphic functionscontinuationtype-2 theory

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analytic continuation of functions of one complex variable (30B40)

Related Items (3)

Effective Riemann mappings of multiply connected domains and Riemann surfaces ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Representation theorems for analytic machines and computability of analytic functions

Cites Work

• On the computational complexity of the Riemann mapping
• Computing power series in polynomial time
• An effective Riemann Mapping Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower Bounds on the Continuation of Holomorphic Functions