Linear decision trees are too weak for convex hull problem (Q1155366): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(81)90112-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2060561824
@@ Property / OpenAlex ID: W2060561824 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding the convex hull of a set of points
+Normal rank
@@ Property / cites work @@
+On the complexity of computations under varying sets of primitives
+Normal rank
@@ Property / cites work @@
+On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for determining the convex hull of a finite planar set
+Normal rank
@@ Property / cites work @@
+Q5547252
@@ Property / cites work: Q5547252 / rank @@
+Normal rank
@@ Property / cites work @@
+A Lower Bound to Finding Convex Hulls
@@ Property / cites work: A Lower Bound to Finding Convex Hulls / rank @@
+Normal rank
@@ Property / cites work @@
+Comments on a lower bound for convex hull determination
+Normal rank