5 citations · 11 across the 4 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2011★ 2 cited
On the Complexity of Solving a Bivariate Polynomial System
Pavel Emeliyanenko, Michael Sagraloff
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm BISOLVE. BISOLVE is a classical elimination method wh…
cs.SC2011★ 4 cited
Arrangement Computation for Planar Algebraic Curves
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel +1
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposit…