Cita APA (7a ed.)

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}$.

Cita Chicago Style (17a ed.)

Hair, Isaac M., y 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.

Cita MLA (9a ed.)

Hair, Isaac M., y 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.