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

DOI10.1016/0304-3975(94)00154-BMaRDI QIDQ673102zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

polynomial-time computable simple curve

Mathematics Subject Classification ID

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

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

Cites work

• Computational complexity of real functions
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• Some complexity issues on the simply connected regions of the two-dimensional plane
• The computational complexity of maximization and integration

Cited in

(17)

• Computable invariance
• Computability structure of the Sobolev spaces and its applications
• On the computability of fractal dimensions and Hausdorff measure
• A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality
• On the computability of rectifiable simple curve. (Extended abstract)
• Curves that must be retraced
• Points on Computable Curves of Computable Lengths
• In Memoriam: Ker-I Ko (1950–2018)
• Who asked us? How the theory of computing answers questions about analysis
• The power of backtracking and the confinement of length
• Jordan Areas and Grids
• Jordan curves with polynomial inverse moduli of continuity
• Curves that must be retraced
• A polynomial time computable metric between points sets
• Computability of measurable sets via effective topologies
• On the complexity of computing the logarithm and square root functions on a complex domain
• Jordan curves with polynomial inverse moduli of continuity

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)