@INPROCEEDINGS{BrisebarreChevillard2007,
  author = {Brisebarre, Nicolas and Chevillard, Sylvain},
  title = {{Efficient polynomial ${L}^{\infty}$-approximations}},
  booktitle = {{18th IEEE SYMPOSIUM on Computer Arithmetic}},
  year = {2007},
  editor = {P.~Kornerup and J.-M.~Muller},
  pages = {169--176},
  address = {Los Alamitos, CA},
  month = {Jun},
  publisher = {IEEE Computer Society},
  hal = {inria-00119513},
  doi = {10.1109/ARITH.2007.17},
  abstract = {We address the problem of computing a good
                  floating-point-coefficient polynomial approximation to a
                  function, with respect to the supremum norm. This is a key
                  step in most processes of evaluation of a function.  We
                  present a fast and efficient method, based on lattice basis
                  reduction, that often gives the best polynomial possible and
                  most of the time returns a very good approximation.},
  keywords = {Efficient polynomial approximation, floating-point arithmetic,
                  absolute error, $L^\infty$ norm, lattice basis reduction,
                  closest vector problem, LLL algorithm.}
}