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

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jco.2013.03.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2021081859
@@ Property / OpenAlex ID: W2021081859 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4160434
@@ Property / cites work: Q4160434 / rank @@
+Normal rank
@@ Property / cites work @@
+Computability on subsets of Euclidean space. I: Closed and compact subsets
+Normal rank
@@ Property / cites work @@
+Q3600690
@@ Property / cites work: Q3600690 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Two-Dimensional Regions
+Normal rank
@@ Property / cites work @@
+The computational complexity of distance functions of two-dimensional domains
+Normal rank
@@ Property / cites work @@
+Q4942157
@@ Property / cites work: Q4942157 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002474
@@ Property / cites work: Q4002474 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249729
@@ Property / cites work: Q4249729 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of real functions
@@ Property / cites work: Computational complexity of real functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994907
@@ Property / cites work: Q3994907 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4485693
@@ Property / cites work: Q4485693 / rank @@
+Normal rank
@@ Property / cites work @@
+Point-Separable Classes of Simple Computable Planar Curves
+Normal rank