Paper

The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)

1998

Created by ACM worker at 2019-04-09 18:00:00.0.
Last updated by ACM worker at 2019-04-11 18:13:38.0.

Simplified Graph of Associations

Word Cloud

Research Paradigm

Authors

1

Venue

1

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98

Referenced By

2

Tensor-based hardness of the shortest vector problem to within almost polynomial factors

(Gap/S)ETH hardness of SVP