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

DOI10.1016/0304-3975(94)00154-BzbMath0874.68287OpenAlexW1964473643MaRDI QIDQ673102

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

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

Related Items

Computability of measurable sets via effective topologies ⋮ Points on Computable Curves of Computable Lengths ⋮ On the complexity of computing the logarithm and square root functions on a complex domain ⋮ A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality ⋮ 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 ⋮ Jordan curves with polynomial inverse moduli of continuity ⋮ Computable invariance ⋮ Computability structure of the Sobolev spaces and its applications ⋮ On the computability of fractal dimensions and Hausdorff measure

Cites Work

• Unnamed Item
• 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

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