A. Sahai

collaborators

2 papers

cs.CC2026

SVP $_{p}$ is Deterministically NP-Hard for all $p > 2$ , Even to Approximate Within a Factor of $2^{l o g^{1 - ε} n}$

Isaac M. Hair, Amit Sahai

We prove that SVP $_{p}$ is NP-hard to approximate within a factor of $2^{l o g^{1 - ε} n}$ , for all constants $ε > 0$ and $p > 2$ , under standard deterministic Kar…

cs.LG2026

Beyond What Seems Necessary: Hidden Gains from Scaling Training-Time Reasoning Length under Outcome Supervision

Yihao Xue, Allan Zhang, Jianhao Huang +2

Training LLMs to think and reason for longer has become a key ingredient in building state-of-the-art models that can solve complex problems previously out of reach. Recent efforts…

SVPp​ is Deterministically NP-Hard for all p>2, Even to Approximate Within a Factor of 2log1−εn

Beyond What Seems Necessary: Hidden Gains from Scaling Training-Time Reasoning Length under Outcome Supervision

SVP $_{p}$ is Deterministically NP-Hard for all $p > 2$ , Even to Approximate Within a Factor of $2^{l o g^{1 - ε} n}$