@ndbunner

The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract)

. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, page 10--19. New York, NY, USA, ACM, (1998)

Description

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

Links and resources

DOI:
10.1145/276698.276705
URL:
BibTeX key:
Ajtai:1998:SVP:276698.276705
search on:

Comments and Reviews  
(0)

There is no review or comment yet. You can write one!

Tags


Cite this publication