{
  "id": "1402.3246",
  "version": "v1",
  "published": "2014-02-13T18:30:36.000Z",
  "updated": "2014-02-13T18:30:36.000Z",
  "title": "Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time",
  "authors": [
    "David Harvey",
    "Andrew V. Sutherland"
  ],
  "comment": "17 pages",
  "doi": "10.1112/S1461157014000187",
  "categories": [
    "math.NT"
  ],
  "abstract": "We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An implementation for hyperelliptic curves of genus 2 and 3 is more than an order of magnitude faster than alternative methods for N = 2^26.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-02-13T18:30:36.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "11G20",
      "11Y16",
      "11M38",
      "14G10"
    ],
    "keywords": [
      "average polynomial time",
      "computing hasse-witt matrices",
      "hyperelliptic curve c/q modulo",
      "average polynomial-time algorithm",
      "magnitude faster"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 17,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1402.3246H"
    }
  }
}