A near-optimal algorithm for computing real roots of sparse polynomials

From MaRDI portal
Publication:3452416

DOI10.1145/2608628.2608632zbMath1325.65068arXiv1401.6011OpenAlexW2059357470MaRDI QIDQ3452416

Michael Sagraloff

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.6011




Related Items (6)


Uses Software


Cites Work


This page was built for publication: A near-optimal algorithm for computing real roots of sparse polynomials