On the complexity of computing the diameter of a polytope (Q1337144): Difference between revisions

@@ Property / author @@
-Q228771
@@ Property / author: Q228771 / rank @@
-Normal rank
@@ Property / author @@
+Alan M. Frieze
@@ Property / author: Alan M. Frieze / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A quasi-polynomial bound for the diameter\\of graphs of polyhedra
+Normal rank
@@ Property / cites work @@
+Polytope pairs and their relationship to linear programming
+Normal rank
@@ Property / cites work @@
+Q3320130
@@ Property / cites work: Q3320130 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths on Polytopes
@@ Property / cites work: Paths on Polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets (and some facets of complexity)
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01206636
+Normal rank
@@ Property / OpenAlex ID @@
+W2010362899
@@ Property / OpenAlex ID: W2010362899 / rank @@
+Normal rank