On the bit complexity of polynomial system solving
From MaRDI portal
Publication:1734694
DOI10.1016/j.jco.2018.09.005zbMath1432.13020arXiv1612.07786MaRDI QIDQ1734694
Guillermo Matera, Nardo Giménez
Publication date: 27 March 2019
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.07786
Chow form; bit complexity; lucky primes; lifting fibers; polynomial system solving over \(\mathbb{Q}\); reduced regular sequence
65H10: Numerical computation of solutions to systems of equations
65Y20: Complexity and performance of numerical algorithms
13P15: Solving polynomial systems; resultants
Uses Software