Paper

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

2007

Created by Alysson Bolognesi Prado at 2019-03-27 15:15:22.0.

Simplified Graph of Associations

Word Cloud

Bibliographic Sets

1

Research Paradigm

Authors

2

Venue

1

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC ’07

References

2

Lattice problems in NP ? coNP

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