Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms. Dadush, D. & Vempala, S. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, pages 1445–1456, 2012.
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms [link]Paper  bibtex   
@inproceedings{DBLP:conf/soda/DadushV12,
  author    = {Daniel Dadush and
               Santosh Vempala},
  title     = {Deterministic construction of an approximate M-ellipsoid and its applications
               to derandomizing lattice algorithms},
  booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  pages     = {1445--1456},
  year      = {2012},
  crossref  = {DBLP:conf/soda/2012},
  url       = {http://portal.acm.org/citation.cfm?id=2095230\&\#38;CFID=63838676\&\#38;CFTOKEN=79617016},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/DadushV12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0