Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISSAC
/
Paper
A near-optimal algorithm for computing real roots of sparse polynomials.
Michael Sagraloff
Venue
B
ISSAC
Year
2014
Proceedings
ISSAC
DBLP record
conf/issac/Sagraloff14 ↗
Browse the full
ISSAC paper archive
.