{"paper":{"title":"Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"cs.DS","authors_text":"Chandan Dubey, Thomas Holenstein","submitted_at":"2011-06-14T06:30:29Z","abstract_excerpt":"We give a polynomial time Turing reduction from the $\\gamma^2\\sqrt{n}$-approximate closest vector problem on a lattice of dimension $n$ to a $\\gamma$-approximate oracle for the shortest vector problem. This is an improvement over a reduction by Kannan, which achieved $\\gamma^2n^{3/2}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2619","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}