Approximate solutions of polynomial equations.

DOI10.1006/JSCO.2001.0505MaRDI QIDQ1599546zbMATH OpenOpenAlexFDO

Authors 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) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Numerical computation of solutions to systems of equations (65H10) Computational aspects and applications of commutative rings (13P99)

Recommendations

• Algorithms for near solutions to polynomial equations
• Near solutions of polynomial equations
• scientific article; zbMATH DE number 1254271
• Complexity of Bezout's theorem. V: Polynomial time
• A well-characterized approximation problem

Cites work

• scientific article; zbMATH DE number 3987272 (Why is no real title available?)
• scientific article; zbMATH DE number 3765914 (Why is no real title available?)
• scientific article; zbMATH DE number 47563 (Why is no real title available?)
• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Computational complexities of diophantine equations with parameters
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Factoring multivariate integral polynomials
• Factoring polynomials with rational coefficients
• On the computational power of pushdown automata
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599546)