On the complexity of computing the Hausdorff distance (Q2434923): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ker-I. Ko / rank
Normal rank
 
Property / author
 
Property / author: Ker-I. Ko / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2013.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021081859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of Euclidean space. I: Closed and compact subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3600690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Two-Dimensional Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of distance functions of two-dimensional domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-Separable Classes of Simple Computable Planar Curves / rank
 
Normal rank

Latest revision as of 07:11, 7 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of computing the Hausdorff distance
scientific article

    Statements

    On the complexity of computing the Hausdorff distance (English)
    0 references
    3 February 2014
    0 references
    Hausdorff distance
    0 references
    computational complexity
    0 references
    polynomial-time
    0 references
    two-dimensional plane
    0 references
    curves
    0 references
    Turing machine
    0 references
    0 references

    Identifiers