Date of Original Version
Abstract or Table of Contents
Abstract: "In this paper, some results on the complexity of computing the combinatorial diameter of a polytope are presented. We show that it is D[superscript P]-hard to determine the diameter of a polytope specified by linear inequalities with integer data. Our result partially resolves a long-term open question."