Algorithms for near solutions to polynomial equations
From MaRDI portal
Publication:840709
DOI10.1016/J.JSC.2009.04.002zbMATH Open1201.13009OpenAlexW2044092136MaRDI QIDQ840709FDOQ840709
Authors: 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
Recommendations
Cites Work
- Factoring polynomials with rational coefficients
- On the computational power of pushdown automata
- Title not available (Why is that?)
- Near solutions of polynomial equations
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Approximate solutions of polynomial equations.
- Title not available (Why is that?)
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
Cited In (10)
- Near solutions of polynomial equations
- Approximate solutions of polynomial equations.
- The natural algorithmic approach of mixed trigonometric-polynomial problems
- Solving polynomial equations in smoothed polynomial time and a near solution to Smale's 17th problem
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- A non-NP-complete algorithm for a quasi-fixed polynomial problem
- An Algorithm for Solving Polynomial Equations
- A Halley‐Like Hybrid Method for Solving Polynomial Equations
- Solving polynomial equations. Foundations, algorithms, and applications
- Title not available (Why is that?)
This page was built for publication: Algorithms for near solutions to polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840709)
