{
  "id": "math/0106093",
  "version": "v2",
  "published": "2001-06-12T15:26:19.000Z",
  "updated": "2002-08-14T05:46:28.000Z",
  "title": "On the Complexity of Polytope Isomorphism Problems",
  "authors": [
    "Volker Kaibel",
    "Alexander Schwartz"
  ],
  "comment": "16 pages; to appear in: Graphs and Comb.; replaces our paper ``On the Complexity of Isomorphism Problems Related to Polytopes'' (June 2001)",
  "categories": [
    "math.CO",
    "math.MG"
  ],
  "abstract": "We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time algorithm for the combinatorial polytope isomorphism problem in bounded dimensions. Furthermore, we derive that the problems to decide whether two polytopes, given either by vertex or by facet descriptions, are projectively or affinely isomorphic are graph isomorphism hard. The original version of the paper (June 2001, 11 pages) had the title ``On the Complexity of Isomorphism Problems Related to Polytopes''. The main difference between the current and the former version is a new polynomial time algorithm for polytope isomorphism in bounded dimension that does not rely on Luks polynomial time algorithm for checking two graphs of bounded valence for isomorphism. Furthermore, the treatment of geometric isomorphism problems was extended.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2002-08-14T05:46:28.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "52B05",
      "05C60",
      "52B11",
      "68R10"
    ],
    "keywords": [
      "complexity",
      "combinatorial polytope isomorphism problem",
      "luks polynomial time algorithm",
      "graph isomorphism hard",
      "graph isomorphism complete"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2001math......6093K"
    }
  }
}