"SVPp Is Deterministically NP-Hard for All p > 2, Even ..."

Isaac M. Hair, Amit Sahai (2026)

> Home

Details and statistics

DOI: 10.1145/3798129.3800879

access: closed

type: Conference or Workshop Paper

metadata version: 2026-06-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/HairS26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/HairS26
Isaac M. Hair, Amit Sahai:
SVP_p Is Deterministically NP-Hard for All p > 2, Even to Approximate within a Factor of 2^{log^1-εn}. STOC 2026: 1716-1727

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.