Gorav Jindal, Michael Sagraloff. Efficiently Computing Real Roots of Sparse Polynomials. In Michael A. Burr, Chee K. Yap, Mohab Safey El Din, editors, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017. pages 229-236, ACM, 2017. [doi]
@inproceedings{JindalS17-2,
title = {Efficiently Computing Real Roots of Sparse Polynomials},
author = {Gorav Jindal and Michael Sagraloff},
year = {2017},
doi = {10.1145/3087604.3087652},
url = {http://doi.acm.org/10.1145/3087604.3087652},
researchr = {https://researchr.org/publication/JindalS17-2},
cites = {0},
citedby = {0},
pages = {229-236},
booktitle = {Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017},
editor = {Michael A. Burr and Chee K. Yap and Mohab Safey El Din},
publisher = {ACM},
isbn = {978-1-4503-5064-8},
}