Michael Sagraloff

activity

20062021

most citedComputing Real Roots of Real Polynomials ... and now For Real!

33 citations · 106 across the 19 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

math.NA2014

A Near-Optimal Algorithm for Computing Real Roots of Sparse Polynomials

Michael Sagraloff

Let $p \in Z [x]$ be an arbitrary polynomial of degree $n$ with $k$ non-zero integer coefficients of absolute value less than $2^{τ}$ . In this paper, we answer the open questio…

cs.SC2014

On the Complexity of Computing with Planar Algebraic Curves

Alexander Kobel, Michael Sagraloff

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$ , $g \in…