{
  "id": "lls90-cvpp-poly-advice-search",
  "categoryId": "cvpp-polynomial-advice-search",
  "paperId": "lagarias-lenstra-schnorr-1990",
  "year": 1990,
  "date": "1990-12-31",
  "time": {
    "coefficient": null,
    "expression": "poly(input size) query time"
  },
  "space": {
    "coefficient": null,
    "expression": "Polynomial-size preprocessed bases"
  },
  "tags": [
    "preprocessing",
    "polynomial advice",
    "approximate search"
  ],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "Reciprocal Korkin–Zolotarev bases yield the classical O(n^{3/2}) search-CVPP approximation. The original transference and closest-point bounds are in Theorem 2.7 and §6; the preprocessing interpretation is explicitly described by Regev §I and DRS §1.",
  "extra": {
    "norm": "Euclidean ℓ₂",
    "approximation": "O(n^{3/2})",
    "preprocessing": "Unbounded; lattice-only reciprocal KZ bases",
    "advice": "Polynomial-size collection of bases",
    "success": "Deterministic online search"
  },
  "evidence": {
    "url": "https://citeseerx.ist.psu.edu/document?doi=5b2ea968d8ad845f0af8c6ed8f2c55f6f5b7973f&repid=rep1&type=pdf",
    "locator": "Theorem 2.7 and §6; interpretation cross-checked in Regev 2004 §I and DRS 2014 §1",
    "sourceVersion": "Combinatorica 10(4), 1990"
  },
  "datePrecision": "year"
}