Buscar
Mostrando ítems 1-1 de 1
On the bit complexity of polynomial system solving
(Academic Press Inc Elsevier Science, 2019-04)
We describe and analyze a randomized algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence outside a given hypersurface. We show that its bit complexity is roughly quadratic ...