arXiv (All)
open access
Polynomial-Factor Deterministic NP-Hardness for SVP in Every lp Norm with p > 2
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
- Polynomial-Factor Deterministic NP-Hardness for SVP in Every lp Norm with p > 2#633652
- Connections between semidefinite relaxations of the max-cut and stable set problems#458507
- Tensor nuclear norm minimization with linear constraints#1117931
- Operator Norm Bounds for Multi-leg Matrix Tensors and Applications to Random Matrix Theory#1156312
- 4-Block Integer Programming is in FPT#1062672
Record · ID 636001
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