The hardness of polynomial equation solving

DOI10.1007/s10208-002-0065-7zbMath1049.68070arXivmath/0301194MaRDI QIDQ1430505

D. Massart

Publication date: 27 May 2004

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0301194

zbMATH Keywords

complexity; polynomial equations; elimination; continuous encoding; data stuctures

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68P05: Data structures

Uses Software

• Kronecker