"Approximating the SVP to within a Factor (1+1/dimxi) Is NP-Hard ..."

Jin-yi Cai, Ajay Nerurkar (1999)

> Home

Details and statistics

DOI: 10.1006/JCSS.1999.1649

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/CaiN99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/CaiN99
Jin-yi Cai, Ajay Nerurkar:
Approximating the SVP to within a Factor (1+1/dim^xi) Is NP-Hard under Randomized Reductions. J. Comput. Syst. Sci. 59(2): 221-239 (1999)

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.