Jordan curves with polynomial inverse moduli of continuity
From MaRDI portal
Publication:995570
DOI10.1016/j.tcs.2007.04.020zbMath1188.68146MaRDI QIDQ995570
Publication date: 3 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.020
Jordan curve; \(NP\); \(P\); \(PSPACE\); computational complexity of real functions; polynomial inverse modulus of continuity
68Q25: Analysis of algorithms and problem complexity
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
In Memoriam: Ker-I Ko (1950–2018), Who Asked Us? How the Theory of Computing Answers Questions about Analysis
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