Jordan curves with polynomial inverse moduli of continuity
From MaRDI portal
(Redirected from Publication:995570)
Recommendations
- Jordan curves with polynomial inverse moduli of continuity
- The computational complexity of distance functions of two-dimensional domains
- On the complexity of finding paths in a two-dimensional domain I: Shortest paths
- scientific article; zbMATH DE number 2063224
- Computational Complexity of Two-Dimensional Regions
Cites work
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1418967 (Why is no real title available?)
- A polynomial-time computable curve whose interior has a nonrecursive measure
- Computational Complexity of Two-Dimensional Regions
- Computing and Combinatorics
- Non-computable Julia sets
- On the complexity of finding paths in a two-dimensional domain I: Shortest paths
- The computational complexity of some Julia sets
- The constructive Jordan curve theorem
Cited in
(6)- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
- The computational complexity of distance functions of two-dimensional domains
- In Memoriam: Ker-I Ko (1950–2018)
- Jordan curves with polynomial inverse moduli of continuity
- Computational Complexity of Two-Dimensional Regions
- Who asked us? How the theory of computing answers questions about analysis
This page was built for publication: Jordan curves with polynomial inverse moduli of continuity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995570)