A polynomial-time computable curve whose interior has a nonrecursive measure

DOI10.1016/0304-3975(94)00154-BzbMATH Open0874.68287OpenAlexW1964473643MaRDI QIDQ673102FDOQ673102

Ker-I Ko

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00154-b

Recommendations

• A Polynomial Time Complexity Bound for Computations on Curves
• A polynomial time computable metric between points sets
• Points on Computable Curves of Computable Lengths
• On the computability of rectifiable simple curve. (Extended abstract)
• Computable planar curves intersect in a computable point
• A polynomial-time algorithm for the topological type of real algebraic curve
• scientific article; zbMATH DE number 3915627
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• Computing the topology of a bounded non algebraic curve in the plane
• Point-separable classes of simple computable planar curves

zbMATH Keywords

polynomial-time computable simple curve

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computation over the reals, computable analysis (03D78)

Cites Work

• Title not available (Why is that?)
• The computational complexity of maximization and integration
• Computational complexity of real functions
• Some complexity issues on the simply connected regions of the two-dimensional plane

Cited In (15)

• A polynomial time computable metric between points sets
• Jordan Areas and Grids
• Computability of measurable sets via effective topologies
• Curves that must be retraced
• Who Asked Us? How the Theory of Computing Answers Questions about Analysis
• Computable invariance
• Jordan curves with polynomial inverse moduli of continuity
• On the complexity of computing the logarithm and square root functions on a complex domain
• Computability structure of the Sobolev spaces and its applications
• Jordan Curves with Polynomial Inverse Moduli of Continuity
• In Memoriam: Ker-I Ko (1950–2018)
• The power of backtracking and the confinement of length
• A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality
• Points on Computable Curves of Computable Lengths
• On the computability of fractal dimensions and Hausdorff measure

This page was built for publication: A polynomial-time computable curve whose interior has a nonrecursive measure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673102)