APA (7th ed.) Citation

Hair, I. M., & Sahai, A. (2025). SVP$_p$ is Deterministically NP-Hard for all $p > 2$, Even to Approximate Within a Factor of $2^{\log^{1-\varepsilon} n}$.

Chicago Style (17th ed.) Citation

Hair, Isaac M., and Amit Sahai. SVP$_p$ Is Deterministically NP-Hard for All $p > 2$, Even to Approximate Within a Factor of $2^{\log^{1-\varepsilon} N}$. 2025.

MLA (9th ed.) Citation

Hair, Isaac M., and Amit Sahai. SVP$_p$ Is Deterministically NP-Hard for All $p > 2$, Even to Approximate Within a Factor of $2^{\log^{1-\varepsilon} N}$. 2025.