The computational complexity of distance functions of two-dimensional domains

DOI10.1016/J.TCS.2004.11.016zbMath1087.03023OpenAlexW2017826306MaRDI QIDQ557838

Arthur W. Chou, Ker-I. Ko

Publication date: 30 June 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.11.016

zbMATH Keywords

computational complexitydistance functionP and NPpolynomial-time computability

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

GLOBAL ATTRACTIVITY, ASYMPTOTIC STABILITY AND BLOW-UP POINTS FOR NONLINEAR FUNCTIONAL-INTEGRAL EQUATIONS’ SOLUTIONS AND APPLICATIONS IN BANACH SPACE BC(R+) WITH COMPUTATIONAL COMPLEXITY ⋮ On the complexity of computing the Hausdorff distance ⋮ In Memoriam: Ker-I Ko (1950–2018) ⋮ Who Asked Us? How the Theory of Computing Answers Questions about Analysis ⋮ On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• On the complexity of finding paths in a two-dimensional domain I: Shortest paths
• On the definitions of some complexity classes of real numbers
• Computational Complexity of Two-Dimensional Regions

This page was built for publication: The computational complexity of distance functions of two-dimensional domains