Finding the Smallest Gap between Sums of Square Roots

Qi Cheng, Yu-Hsin Li. Finding the Smallest Gap between Sums of Square Roots. In Alejandro López-Ortiz, editor, LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Volume 6034 of Lecture Notes in Computer Science, pages 446-455, Springer, 2010. [doi]

@inproceedings{ChengL10-0,
  title = {Finding the Smallest Gap between Sums of Square Roots},
  author = {Qi Cheng and Yu-Hsin Li},
  year = {2010},
  doi = {10.1007/978-3-642-12200-2_39},
  url = {http://dx.doi.org/10.1007/978-3-642-12200-2_39},
  researchr = {https://researchr.org/publication/ChengL10-0},
  cites = {0},
  citedby = {0},
  pages = {446-455},
  booktitle = {LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings},
  editor = {Alejandro López-Ortiz},
  volume = {6034},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-12199-9},
}