Complexity of solving parametric polynomial systems
From MaRDI portal
Publication:2256707
Recommendations
- An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
- On factoring parametric multivariate polynomials
- scientific article; zbMATH DE number 1263377
- Solving parametric polynomial systems
- Complexity of the resolution of parametric systems of polynomial equations and inequations
Cites work
- scientific article; zbMATH DE number 3133601 (Why is no real title available?)
- scientific article; zbMATH DE number 3823145 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 1263216 (Why is no real title available?)
- scientific article; zbMATH DE number 1263377 (Why is no real title available?)
- scientific article; zbMATH DE number 1273648 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1736028 (Why is no real title available?)
- scientific article; zbMATH DE number 1952043 (Why is no real title available?)
- scientific article; zbMATH DE number 1795740 (Why is no real title available?)
- scientific article; zbMATH DE number 939812 (Why is no real title available?)
- scientific article; zbMATH DE number 3804835 (Why is no real title available?)
- scientific article; zbMATH DE number 3445379 (Why is no real title available?)
- scientific article; zbMATH DE number 2110642 (Why is no real title available?)
- scientific article; zbMATH DE number 3055967 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A new algorithm for discussing Gröbner bases with parameters.
- Algebraic Geometry. I: Complex projective varieties.
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- Algorithms in real algebraic geometry
- Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination
- An algorithm for solving parametric linear systems
- Approximate factorization of multivariate polynomials via differential equations
- Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
- Complexity bound for the absolute factorization of parametric polynomials
- Complexity of quantifier elimination in the theory of ordinary differential equations
- Complexity of the resolution of parametric systems of polynomial equations and inequations
- Complexity results for triangular sets
- Comprehensive Gröbner bases
- Computer Algebra in Scientific Computing
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- Computing parametric geometric resolutions
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Definability and fast quantifier elimination in algebraically closed fields
- Deformation techniques for efficient polynomial equation solving.
- Effective equidimensional decomposition of affine varieties
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring Polynomials Over Large Finite Fields
- Factoring multivariate polynomials over finite fields
- Factoring multivariate polynomials via partial differential equations
- Factoring polynomials with rational coefficients
- Factorization of Multivariate Polynomials Over Finite Fields
- Factorization of polynomials and some linear-algebra problems over finite fields
- Factorization of polynomials over a finite field and the solution of systems of algebraic equations
- Lifting and recombination techniques for absolute factorization
- Lower bounds for diophantine approximations
- On Hensel factorization. I
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Problem section (rotating fluids)
- Resolution of polynomial systems
- Résolution des systèmes d'équations algébriques
- Sharp estimates for triangular sets
- Solving parametric polynomial systems
- Solving polynomial equations. Foundations, algorithms, and applications
- Solving zero-dimensional algebraic systems
- Solving zero-dimensional systems through the rational univariate representation
- Vandermonde matrices, NP-completeness and transversal subspaces
Cited in
(18)- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III
- Computational complexity of solving polynomial differential equations over unbounded domains
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- On solving parametric polynomial systems
- Computing parametric geometric resolutions
- Complexity of the resolution of parametric systems of polynomial equations and inequations
- On computing absolutely irreducible components of algebraic varieties with parameters
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
- Complexity bound for the absolute factorization of parametric polynomials
- MRHS Equation Systems that can be Solved in Polynomial Time
- Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
- The complexity of deciding consistency of systems of polynomials in exponent inequalities
- Computations with parameters: a theoretical background
- Solving parametric polynomial systems
- On factoring parametric multivariate polynomials
- Condition length and complexity for the solution of polynomial systems
- An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
- Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II
This page was built for publication: Complexity of solving parametric polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256707)
