Complexity of approximating the vertex centroid of a polyhedron (Q764376): Difference between revisions

@@ Property / author @@
-Khaled M. Elbassioni
@@ Property / author: Khaled M. Elbassioni / rank @@
-Normal rank
@@ Property / author @@
+Khaled M. Elbassioni
@@ Property / author: Khaled M. Elbassioni / 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.tcs.2011.11.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2081502538
@@ Property / OpenAlex ID: W2081502538 / rank @@
+Normal rank
@@ Property / cites work @@
+How good are convex hull algorithms?
@@ Property / cites work: How good are convex hull algorithms? / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Vertex Enumeration Methods
@@ Property / cites work: The Complexity of Vertex Enumeration Methods / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Computing the Volume of a Polyhedron
+Normal rank
@@ Property / cites work @@
+Random walks and anO*(n5) volume algorithm for convex bodies
+Normal rank
@@ Property / cites work @@
+Generating all vertices of a polyhedron is hard
@@ Property / cites work: Generating all vertices of a polyhedron is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Hard Enumeration Problems in Geometry and Combinatorics
+Normal rank
@@ Property / cites work @@
+Q3602887
@@ Property / cites work: Q3602887 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of computing intersection, union and Minkowski sum of polytopes
+Normal rank
@@ Property / cites work @@
+Lectures on Polytopes
@@ Property / cites work: Lectures on Polytopes / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:764376