33 citations · 59 across the 4 of their papers we have counts for
1 paper · 1 filter
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…