Jordan Curves with Polynomial Inverse Moduli of Continuity
From MaRDI portal
Publication:4921453
DOI10.1016/j.entcs.2006.08.022zbMath1262.03084OpenAlexW1968635052MaRDI QIDQ4921453
Publication date: 10 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.2006.08.022
Analysis of algorithms and problem complexity (68Q25) Computation over the reals, computable analysis (03D78)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial-time computable curve whose interior has a nonrecursive measure
- The constructive Jordan curve theorem
- 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
- Computing and Combinatorics
This page was built for publication: Jordan Curves with Polynomial Inverse Moduli of Continuity