{
  "id": "math/0301147",
  "version": "v1",
  "published": "2003-01-14T17:36:31.000Z",
  "updated": "2003-01-14T17:36:31.000Z",
  "title": "Navigating the Cayley graph of SL(2,Z/pZ)",
  "authors": [
    "Michael Larsen"
  ],
  "comment": "6 pages",
  "categories": [
    "math.GR"
  ],
  "abstract": "This paper describes a non-deterministic polynomial-time algorithm to find a path of length O(log p loglog p) between any two vertices of the Cayley graph of SL(2,Z/pZ).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2003-01-14T17:36:31.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C25",
      "20F65",
      "68Q25",
      "68R10"
    ],
    "keywords": [
      "cayley graph",
      "non-deterministic polynomial-time algorithm",
      "navigating"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2003math......1147L"
    }
  }
}