{
  "id": "aharonov-regev05-cvpp-poly-advice-decision",
  "categoryId": "cvpp-polynomial-advice-decision",
  "paperId": "aharonov-regev-2005",
  "year": 2005,
  "date": "2005-09-08",
  "time": {
    "coefficient": null,
    "expression": "poly(input size) query time; degree may depend on c"
  },
  "space": {
    "coefficient": null,
    "expression": "poly(input size) advice; degree may depend on c"
  },
  "tags": [
    "preprocessing",
    "polynomial advice",
    "decision"
  ],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "Theorem 1.4 gives a polynomial query algorithm for GapCVPP with factor c√(n/log n) for every fixed c > 0. Section 5 computes an estimator using polynomially many preprocessed dual-lattice vectors.",
  "extra": {
    "norm": "Euclidean ℓ₂",
    "approximation": "c√(n/log n), for every fixed c > 0",
    "preprocessing": "Unbounded; lattice-only advice",
    "advice": "N = poly(n) dual-lattice vectors; degree depends on c",
    "success": "Polynomial-time gap decision from suitable fixed advice"
  },
  "evidence": {
    "url": "https://cims.nyu.edu/~regev/papers/cvpconp.pdf",
    "locator": "Theorem 1.4 and §5 proof",
    "sourceVersion": "Author manuscript dated 8 September 2005; JACM 52(5), 2005"
  }
}