## Miklós Ajtai

*The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions*

STOC, 1998.

@inproceedings{STOC-1998-Ajtai, author = "Miklós Ajtai", booktitle = "{Proceedings of the 30th Annual ACM Symposium on Theory of Computing}", doi = "10.1145/276698.276705", isbn = "0-89791-962-9", pages = "10--19", publisher = "{ACM}", title = "{The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions}", year = 1998, }