Algorithms for near solutions to polynomial equations
From MaRDI portal
Publication:840709
Recommendations
Cites work
- scientific article; zbMATH DE number 1305293 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- Approximate solutions of polynomial equations.
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring polynomials with rational coefficients
- Near solutions of polynomial equations
- On the computational power of pushdown automata
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
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
- scientific article; zbMATH DE number 819105 (Why is no real title available?)
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)