Conceptio
›
Archive
›
Arxiv Oai Expanded
Arxiv Oai Expanded
metadata only
Polynomial-Factor Deterministic NP-Hardness for SVP in Every lp Norm with p > 2
Hair, Isaac M et al.
Arxiv Oai Expanded · Other
Open Source ↗
Direct PDF ↓
computational complexity
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record
· ID 633652
Retrieved via
Conceptio
— every document is proof-bundled with source, license, and retrieval metadata.