computable analysisRiemann mapping theoremcomputable conformable mappingsrecursively enumerable subsets of real Euclidean spaces
Recommendations
Cites work
- scientific article; zbMATH DE number 3112803 (Why is no real title available?)
- scientific article; zbMATH DE number 3131932 (Why is no real title available?)
- scientific article; zbMATH DE number 3925185 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 49598 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1222111 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1499089 (Why is no real title available?)
- scientific article; zbMATH DE number 3248210 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A constructive Riemann mapping theorem
- Berechenbare Reelle Funktionen
- Computability on computable metric spaces
- Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
- Computable functionals
- Konstruktive Darstellungen in Topologischen Räumen mit Rekursiver Basis
- On the definitions of computable real continuous functions
- Representations of the real numbers and of the open subsets of the set of real numbers
- The computable multi-functions on multi-represented sets are closed under programming
- Theory of representations
- Type 2 recursion theory
Cited in
(31)- Computable analysis and Blaschke products
- Computing conformal maps of finitely connected domains onto canonical slit domains
- Lower bounds on the continuation of holomorphic functions
- Jordan Areas and Grids
- Carathéodory convergence and harmonic measure
- A local to global principle for the complexity of Riemann mappings (extended abstract)
- A comparison of certain representations of regularly closed sets
- The combinatorial Riemann mapping theorem
- Effectively open real functions
- Computable Carathéodory theory
- An effective Carathéodory theorem
- Towards the complexity of Riemann mappings. (Extended abstract)
- Technical report: computation on the extended complex plane and conformal mapping of multiply-connected domains
- A Simple Proof of a Simple Version of the Riemann Mapping Theorem by Simple Functional Analysis
- On the Computable Theory of Bounded Analytic Functions
- Computable complex analysis
- Non computable Mandelbrot-like sets for a one-parameter complex family
- Conformal mapping in linear time
- Computable Geometric Complex Analysis and Complex Dynamics
- Computability and analysis, a historical approach
- Towards computability over effectively enumerable topological spaces
- Computing boundary extensions of conformal maps
- Riemann mapping theorem in Cn
- A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- An improved Riemann mapping theorem and complexity in potential theory
- Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
- Connected choice and the Brouwer fixed point theorem
- Solving Riemann-Hilbert problems with meromorphic functions
- On the computational complexity of the Riemann mapping
- Effective Riemann mappings of multiply connected domains and Riemann surfaces
This page was built for publication: An effective Riemann Mapping Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292405)
