Laura Sanità On the hardness of computing the diameter of a polytope The diameter of a polytope P is the maximum length of a shortest path between a pair of vertices on the 1-skeleton of P , which is the graph where the vertices correspond to the 0-dimensional faces of P, and the edges are given by the 1-dimensional faces of P. Despite decades of studies, it is still not known whether the diameter of a d-dimensional polytope with n…