An improvement of the complexity bound for solving systems of polynomial equations
From MaRDI portal
Recommendations
- Polynomial complexity of solving systems of few algebraic equations with small degrees
- On the complexity exponent of polynomial system solving
- Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving
- Complexity of Bezout's theorem. V: Polynomial time
- scientific article; zbMATH DE number 806911
Cites work
Cited in
(15)- Upper bounds on the complexity of solving systems of linear equations
- MRHS Equation Systems that can be Solved in Polynomial Time
- scientific article; zbMATH DE number 4157784 (Why is no real title available?)
- The complexity of deciding consistency of systems of polynomials in exponent inequalities
- Solving polynomial equations in smoothed polynomial time and a near solution to Smale's 17th problem
- scientific article; zbMATH DE number 5124810 (Why is no real title available?)
- scientific article; zbMATH DE number 1567790 (Why is no real title available?)
- Polynomial complexity of solving systems of few algebraic equations with small degrees
- Solving systems of polynomial inequalities over a real closed field in subexponential time
- Message length effects for solving polynomial systems on a hypercube
- On the family of cubical multivariate cryptosystems based on the algebraic graph over finite commutative rings of characteristic 2
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited
- Condition length and complexity for the solution of polynomial systems
- An effective algorithm for deciding the solvability of a system of polynomial equations over \(p\)-adic integers
- On probabilistic algorithm for solving almost all instances of the set partition problem
This page was built for publication: An improvement of the complexity bound for solving systems of polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762547)
