On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034): Difference between revisions

@@ Property / author @@
-Ker-I. Ko
@@ Property / author: Ker-I. Ko / rank @@
-Normal rank
@@ Property / author @@
+Ker-I. Ko
@@ Property / author: Ker-I. Ko / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.entcs.2008.03.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2036455597
@@ Property / OpenAlex ID: W2036455597 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-computable Julia sets
@@ Property / cites work: Non-computable Julia sets / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Two-Dimensional Regions
+Normal rank
@@ Property / cites work @@
+On the complexity of finding paths in a two-dimensional domain I: Shortest paths
+Normal rank
@@ Property / cites work @@
+The computational complexity of distance functions of two-dimensional domains
+Normal rank
@@ Property / cites work @@
+Q4947407
@@ Property / cites work: Q4947407 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3348420
@@ Property / cites work: Q3348420 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4942157
@@ Property / cites work: Q4942157 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of maximization and integration
+Normal rank
@@ Property / cites work @@
+Q4002474
@@ Property / cites work: Q4002474 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of computing the logarithm and square root functions on a complex domain
+Normal rank
@@ Property / cites work @@
+Q3994907
@@ Property / cites work: Q3994907 / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of some julia sets
@@ Property / cites work: The computational complexity of some julia sets / rank @@
+Normal rank
@@ Property / cites work @@
+PP is as Hard as the Polynomial-Time Hierarchy
@@ Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Q4485693
@@ Property / cites work: Q4485693 / rank @@
+Normal rank