Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Shortest Vector Problem in L2 is NP-hard for ..."

Miklós Ajtai (1998)

> Home

Details and statistics

DOI: 10.1145/276698.276705

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/Ajtai98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Ajtai98
Miklós Ajtai:
The Shortest Vector Problem in L₂ is NP-hard for Randomized Reductions (Extended Abstract). STOC 1998: 10-19

a service of

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.