Refined bit complexity for the computation of at least one point per connected component of a smooth complete intersection real algebraic set

Jesse Elliott, Mark Giesbrecht, Edern Gillot +2

We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup…