@inproceedings{Ajt98,
	address = {Dallas, Texas, United States},
	title = {The shortest vector problem in {L2} is {NP}-hard for randomized reductions (extended abstract)},
	booktitle = {Proceedings of the thirtieth annual {ACM} symposium on {Theory} of computing  - {STOC} '98},
	publisher = {ACM Press},
	author = {Ajtai, Miklós},
	year = {1998},
	pages = {10--19},
}

@book{Mic02,
	author = {Micciancio, Daniele and Goldwasser, Shafi},
	title = {Complexity of {Lattice} {Problems}},
	year = {2002},
	isbn = {978-1-4613-5293-8 978-1-4615-0897-7},
	publisher = {Springer US},
	address = {Boston, MA},
}

@techreport{EmBo81,
  author      = "van Emde Boas, Peter",
  title       = "{{Another NP-Complete Partition Problem and the Complexity of Computing Short Vectors in a Lattice.}} Tech. Report 81-04",
  institution = "Mathematisch Instituut, Roetersstraat 15, 1018 WB Amsterdam, The Netherlands",
  year        = "1981"
}

@article{Len83,
 author = {Lenstra, Hendrik W.},
 journal = {Mathematics of Operations Research},
 number = {4},
 pages = {538--548},
 publisher = {INFORMS},
 title = {Integer Programming with a Fixed Number of Variables},
 volume = {8},
 year = {1983}
}

@article{LLL,
    author = {Lenstra, A. K. and Lenstra, H.W. and Lovasz, L.},
    title = {Factoring polynomials with rational coefficients},
    journal = {MATH. ANN},
    year = {1982},
    volume = {261},
    pages = {515--534}
}
@article{Babai86,
  title={On {L}ov{\'a}sz’ lattice reduction and the nearest lattice point problem},
  author={L{\'a}szl{\'o} Babai},
  journal={Combinatorica},
  year={1986},
  volume={6},
  pages={1-13}
}
@article{Len81,
  title={Lattices and factorization of polynomials},
  author={Lenstra, Arjen K. },
  journal={SIGSAM Bull.},
  year={1981},
  volume={15},
  pages={15-16}
}

@misc{dummy}
