Approximate solutions of polynomial equations.

DOI10.1006/jsco.2001.0505zbMath1046.13020OpenAlexW2001331304MaRDI QIDQ1599546

R. Smith

Publication date: 11 June 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2001.0505

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Computational aspects and applications of commutative rings (13P99)

Related Items (4)

Algorithms for near solutions to polynomial equations ⋮ A non-NP-complete algorithm for a quasi-fixed polynomial problem ⋮ Max-min of polynomials and exponential Diophantine equations ⋮ Max-min of polynomials and exponential Diophantine equations. II.

Cites Work

• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Factoring polynomials with rational coefficients
• Factoring multivariate integral polynomials
• On the computational power of pushdown automata
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Computational complexities of diophantine equations with parameters
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate solutions of polynomial equations.