{
  "id": "blomer-naewe11v2-cvp-polyhedral-exact",
  "categoryId": "cvp-polyhedral-exact-arithmetic",
  "paperId": "blomer-naewe-2011",
  "year": 2011,
  "date": "2011-05-16",
  "time": {
    "coefficient": 2,
    "expression": "(s log r)^{O(1)} · n^{(2 + o(1))n} arithmetic operations"
  },
  "space": {
    "coefficient": null,
    "expression": "Polynomial space explicitly established in the 12 July v3 refinement"
  },
  "tags": [
    "polyhedral norms",
    "exact",
    "arithmetic model"
  ],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "The 2 leading coefficient for rational polyhedral norms is already explicit in version 2. Its input-size factor depends polynomially on the number s of inequalities. Version 3 supplies a polynomial-space refinement without changing this coefficient.",
  "extra": {
    "norm": "Rational polyhedral norm; centrally symmetric full-dimensional ball",
    "target": "Target in span(L); restrict to full-rank L ⊂ R^n",
    "preprocessing": "Included",
    "model": "Deterministic arithmetic operation count",
    "success": "Exact output",
    "input": "s inequalities; coefficient-size bound r"
  },
  "evidence": {
    "url": "https://arxiv.org/pdf/1104.3720v2",
    "locator": "Abstract; Theorems 3.2 and 3.3; compare v3 Theorem 3.2 for space",
    "sourceVersion": "arXiv:1104.3720v2, 16 May 2011"
  }
}