"On Beating 2ⁿ for the Closest Vector Problem."

Amir Abboud, Rajendra Kumar (2025)

> Home

Details and statistics

DOI: 10.1137/1.9781611978315.39

access: closed

type: Conference or Workshop Paper

metadata version: 2025-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sosa/AbboudK25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sosa/AbboudK25
Amir Abboud, Rajendra Kumar:
On Beating 2ⁿ for the Closest Vector Problem. SOSA 2025: 517-532

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.