Jordan curves with polynomial inverse moduli of continuity

DOI10.1016/J.TCS.2007.04.020zbMath1188.68146OpenAlexW2055915157MaRDI QIDQ995570

Fuxiang Yu, Ker-I. Ko

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

zbMATH Keywords

Jordan curve\(NP\)\(P\)\(PSPACE\)computational complexity of real functionspolynomial inverse modulus of continuity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

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

This page was built for publication: Jordan curves with polynomial inverse moduli of continuity