Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

2014-01-01

Additional Metadata
THEME	Logistics (theme 3)
Publisher	Cornell University Library
Series	arXiv.org e-Print archive
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Aggarwal, D, Dadush, D.N, Regev, O, & Stephens-Davidowitz, N. (2014). Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling. arXiv.org e-Print archive. Cornell University Library .

See Also
inProceedings Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling D. Aggarwal, D.N. Dadush (Daniel), O. Regev (Oded) and N. Stephens-Davidowitz (Noah)
inProceedings Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling D. Aggarwal, D.N. Dadush (Daniel), O. Regev (Oded) and N. Stephens-Davidowitz (Noah)

Publication