Asymptotic acceleration of solving multivariate polynomial systems of equations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1859217
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Accelerated Solution of Multivariate Polynomial Systems of Equations
- scientific article; zbMATH DE number 1263385
- Multilinear polynomial systems: root isolation and bit complexity
Cited in
(15)- Some speed-ups and speed limits for real algebraic geometry
- On solving univariate sparse polynomials in logarithmic time
- Solving degenerate sparse polynomial systems faster
- Multivariate polynomials, duality, and structured matrices
- Multilinear polynomial systems: root isolation and bit complexity
- Analysis of normal-form algorithms for solving systems of polynomial equations
- Irreducible decomposition of polynomial ideals
- On the complexity exponent of polynomial system solving
- scientific article; zbMATH DE number 4211369 (Why is no real title available?)
- Accelerated Solution of Multivariate Polynomial Systems of Equations
- scientific article; zbMATH DE number 1859217 (Why is no real title available?)
- Polynomial-time amoeba neighborhood membership and faster localized solving
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Condition number based complexity estimate for solving polynomial systems
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
This page was built for publication: Asymptotic acceleration of solving multivariate polynomial systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542568)
