Algorithms for near solutions to polynomial equations

DOI10.1016/j.jsc.2009.04.002zbMath1201.13009OpenAlexW2044092136MaRDI QIDQ840709

N. E. Zubov

Publication date: 14 September 2009

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2009.04.002

zbMATH Keywords

algorithmspolynomial equationsnear solutions

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15)

Related Items (1)

A non-NP-complete algorithm for a quasi-fixed polynomial problem

Cites Work

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

This page was built for publication: Algorithms for near solutions to polynomial equations