{
  "id": "asd17-average-exact-svp",
  "categoryId": "svp-provable",
  "paperId": "aggarwal-stephens-davidowitz-2017-average",
  "date": "2017-09-05",
  "datePrecision": "day",
  "year": 2017,
  "time": {
    "coefficient": 1,
    "expression": "2^{1 n + o(n)}"
  },
  "space": {
    "coefficient": 1,
    "expression": "2^{1 n + o(n)}"
  },
  "tags": [
    "classical",
    "provable",
    "arbitrary lattices"
  ],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "A simpler exact-SVP algorithm with the same leading time and space as ADRS15. The abstract explicitly removes a rejection-sampling step from ADRS. This is an equal-exponent algorithmic milestone; it does not lower the standing exponent below 1. The paper’s approximate-CVP statement has its own regime and is not used as an exact-SVP assumption.",
  "extra": {
    "norm": "Euclidean ℓ₂",
    "success": "Randomized exact-SVP guarantee stated by the source",
    "model": "Classical; polynomial input-size factors suppressed"
  },
  "evidence": {
    "url": "https://arxiv.org/abs/1709.01535",
    "locator": "Abstract and submission history",
    "sourceVersion": "arXiv:1709.01535v1, 5 September 2017"
  }
}