arXiv (All)open access
Euclidean SVP is deterministically NP-hard to approximate within any constant factor
computational complexity, number theory
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 997529
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.