arXiv (All)
open access
Euclidean SVP is deterministically NP-hard to approximate within any constant factor
We prove that, for every constant $ρ>1$, the Euclidean shortest vector problem is NP-hard to approximate within any constant factor $ρ$ under a deterministic polynomial-time many-one reduction. This extends our previous deterministic NP-hardness result from $ρ<\sqrt 2$ to arbitrary constants and giv
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- NP-hardness of ideal lattice problems#1109858
- Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs#1064325
- On the worst case complexity of potential reduction algorithms for linear programming#429995
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving#667908
- Stuffed IBLTs: Optimal Linear Multiset Sketches#1123844
Record · ID 997529
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive